An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting

DOI10.1007/978-3-319-08918-8_13zbMath1416.68090OpenAlexW2269082851MaRDI QIDQ5170816

Daniel de Carvalho, Jakob Grue Simonsen

Publication date: 24 July 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08918-8_13

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Unnamed Item ⋮ Read/write factorizable programs ⋮ The Power of Non-determinism in Higher-Order Implicit Complexity

This page was built for publication: An Implicit Characterization of the Polynomial-Time Decidable Sets by Cons-Free Rewriting