Pages that link to "Item:Q1193869"
From MaRDI portal
The following pages link to On polynomial-time Turing and many-one completeness in PSPACE (Q1193869):
Displaying 5 items.
- Cook versus Karp-Levin: Separating completeness notions if NP is not small (Q671427) (← links)
- A comparison of polynomial time completeness notions (Q1097692) (← links)
- Completeness and weak completeness under polynomial-size circuits (Q1917077) (← links)
- Completeness for nondeterministic complexity classes (Q3979608) (← links)
- Deciding Universality of ptNFAs is PSpace-Complete (Q5127189) (← links)