On the Complexity of Flowchart and Loop Program Schemes and Programming Languages

DOI10.1145/322290.322304zbMATH Open0477.68045OpenAlexW2024886091MaRDI QIDQ3933741FDOQ3933741

Authors: H. B. III Hunt 

Publication date: 1982

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322290.322304

zbMATH Keywords

NP-hardPSPACE-hardexecutability problemflowchart program schemeflowchart programming languageloop program schemeloop programming language

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (4)

• Lower bounds and the hardness of counting properties
• A note on the complexity of program evaluation
• The complexity of monadic recursion schemes: executability problems, nesting depth, and applications
• The complexity of monadic recursion schemes: Exponential time bounds

This page was built for publication: On the Complexity of Flowchart and Loop Program Schemes and Programming Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933741)