On Languages Accepted in Polynomial Time
From MaRDI portal
Publication:5645036
DOI10.1137/0201019zbMath0235.68027OpenAlexW2069227855WikidataQ56387786 ScholiaQ56387786MaRDI QIDQ5645036
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
Related Items
A new algorithm design technique for hard problems, Bounded query machines: on NP and PSPACE, On the complexity of finite, pushdown, and stack automata, 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, On Horn spectra, Bandwidth contrained NP-complete problems, Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories, Towards the Actual Relationship Between NP and Exponential Time
