Pages that link to "Item:Q3974851"
From MaRDI portal
The following pages link to Complexity classes with complete problems between P and NP-C (Q3974851):
Displaying 5 items.
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
- Nondeterminism within $P^ * $ (Q4202212) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
- The emptiness problem for intersections of regular languages (Q5096847) (← links)