Documentation

DescriptiveComplexity.Problems.Wide.Corridor

The wide corridor: a strip as wide as the addresses #

DescriptiveComplexity.CORRIDOR with one exponent added in the semantics of the problem, exactly as DescriptiveComplexity.WideTiling adds one to DescriptiveComplexity.TILING: the columns are the subsets of the instance, while the tiles stay an ordinary part of it, and the rows are numbers.

So an instance of size n asks whether a corridor of width 2ⁿ can be tiled upward until an accepting tile appears – the classical second complete problem of EXPSPACE beside a machine. The tile system it reads off an instance is the same DescriptiveComplexity.wideTileData as the square's, so the two problems differ only in the question asked, and the membership is again a composition: the corridor of the exponential expansion, CORRIDOR being in PSPACE.

The problem #

Dependency graph

Tiling a wide corridor. Can the strip whose width is the subsets of the instance be tiled upward, from the bottom row the description allows until an accepting tile appears?

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    Dependency graph

    The membership #

    A wide corridor is an ordinary corridor of the expansion. The tile system is the one DescriptiveComplexity.WideTile.wtileAgree matches field by field; only the question differs.

    Dependency graph

    The wide corridor is in EXPSPACE, which is PSPACE.exp: the expansion turns it into DescriptiveComplexity.CORRIDOR, and that problem is in PSPACE. This is the second natural member the class has, beside the wide machine.

    Dependency graph