On Languages Accepted in Polynomial Time
From MaRDI portal
Publication:5664822
DOI10.1137/0201019zbMath0251.68042OpenAlexW2069227855WikidataQ56387786 ScholiaQ56387786MaRDI QIDQ5664822
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
On nonstochastic languages and homomorphic images of stochastic languages, Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages, Reversal-bounded multipushdown machines, Comparing complexity classes, On the equivalence, containment, and covering problems for the regular and context-free languages, Techniques for separating space complexity classes, P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP