Pages that link to "Item:Q5645036"
From MaRDI portal
The following pages link to On Languages Accepted in Polynomial Time (Q5645036):
Displaying 10 items.
- On Horn spectra (Q757356) (← links)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- Bounded query machines: on NP and PSPACE (Q1158751) (← links)
- Translational lemmas, polynomial time, and \((\log n)^j\)-space (Q1225932) (← links)
- Remarks on the complexity of nondeterministic counter languages (Q1228202) (← links)
- Computational complexity of multitape Turing machines and random access machines (Q1249434) (← links)
- Bandwidth contrained NP-complete problems (Q1822500) (← links)
- A new algorithm design technique for hard problems (Q2173301) (← links)
- On the complexity of finite, pushdown, and stack automata (Q4121398) (← links)
- Towards the Actual Relationship Between NP and Exponential Time (Q4238424) (← links)
