On Languages Accepted in Polynomial Time

DOI10.1137/0201019MaRDI QIDQ5645036zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ronald V. Book

Publication date 1972

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0201019

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(10)

• Bounded query machines: on NP and PSPACE
• Translational lemmas, polynomial time, and \((\log n)^j\)-space
• Remarks on the complexity of nondeterministic counter languages
• Computational complexity of multitape Turing machines and random access machines
• Bandwidth contrained NP-complete problems
• A new algorithm design technique for hard problems
• On the complexity of finite, pushdown, and stack automata
• Towards the Actual Relationship Between NP and Exponential Time
• On Horn spectra
• Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories

This page was built for publication: On Languages Accepted in Polynomial Time

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