Pages that link to "Item:Q5664822"
From MaRDI portal
The following pages link to On Languages Accepted in Polynomial Time (Q5664822):
Displayed 7 items.
- On nonstochastic languages and homomorphic images of stochastic languages (Q1163382) (← links)
- Reversal-bounded multipushdown machines (Q1219160) (← links)
- Comparing complexity classes (Q1227731) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- Techniques for separating space complexity classes (Q1235979) (← links)
- Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages (Q4128015) (← links)
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP (Q4190619) (← links)