The exact complexity of the infinite Post Correspondence Problem (Q2345861)

From MaRDI portal
Revision as of 10:39, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The exact complexity of the infinite Post Correspondence Problem
scientific article

    Statements

    The exact complexity of the infinite Post Correspondence Problem (English)
    0 references
    0 references
    21 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    theory of computation
    0 references
    formal languages
    0 references
    computational complexity
    0 references
    decision problems
    0 references
    infinite Post Correspondence Problem
    0 references
    exact complexity
    0 references
    \(\Pi_1^0\)-complete
    0 references