A predicative and decidable characterization of the polynomial classes of languages
From MaRDI portal
Recommendations
- A decidable characterization of the classes between lintime and exptime
- LOGSPACE and PTIME characterized by programming languages
- An implicit characterization of the polynomial-time decidable sets by cons-free rewriting
- scientific article; zbMATH DE number 806743
- Some Programming Languages for Logspace and Ptime
Cites work
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 2079048 (Why is no real title available?)
- scientific article; zbMATH DE number 806743 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- A new recursion-theoretic characterization of the polytime functions
- Beweistheoretische Untersuchung der verzweigten Analysis
- Rekursionszahlen und die Grzegorczyk-Hierarchie
- SAFE TURING MACHINES, GRZEGORCZYK CLASSES AND POLYTIME
- Undecidability vs transfinite induction for the consistency of hyperarithmetical sets
Cited in
(6)- A decidable characterization of the classes between lintime and exptime
- Predicate characterizations in the polynomial-size hierarchy
- Polynomial languages with finite antidictionaries
- Some Programming Languages for Logspace and Ptime
- scientific article; zbMATH DE number 1796949 (Why is no real title available?)
- scientific article; zbMATH DE number 1361492 (Why is no real title available?)
This page was built for publication: A predicative and decidable characterization of the polynomial classes of languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589422)
