Reachability problem for polynomial iteration is PSPACE-complete (Q1685792)

From MaRDI portal
Revision as of 23:59, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Reachability problem for polynomial iteration is PSPACE-complete
scientific article

    Statements

    title
    Reachability problem for polynomial iteration is PSPACE-complete (English)
    0 references
    author
    Reino Niskanen
    0 references
    publication date
    20 December 2017
    0 references
    zbMATH Keywords
    reachability problem
    0 references
    polynomial iteration
    0 references
    decidability
    0 references

    Identifiers

    zbMATH DE Number
    6820349
    0 references
    OpenAlex ID
    W2745665581
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1685792&oldid=32289326"
    Powered by MediaWiki