The following pages link to On digital nondeterminism (Q4717055):
Displaying 13 items.
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- Dynamical recognizers: real-time language recognition by analog computers (Q1129007) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
- Computing over the reals with addition and order (Q1338216) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- On NP-completeness for linear machines (Q1368835) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- On the P-NP problem over real matrix rings (Q1884926) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- The PCP theorem for NP over the reals (Q2355329) (← links)
- A note on parallel and alternating time (Q2465291) (← links)
- Logics which capture complexity classes over the reals (Q5055931) (← links)
- Generalization of the subset sum problem and cubic forms (Q6039136) (← links)
