The following pages link to Classes of bounded nondeterminism (Q3034815):
Displayed 10 items.
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- On quasilinear-time complexity theory (Q672330) (← links)
- Computing functions with parallel queries to NP (Q673784) (← links)
- On problems with short certificates (Q1338895) (← links)
- On helping by parity-like languages (Q1349740) (← links)
- On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
- Guess-and-verify versus unrestricted nondeterminism for OBDDs and one-way Turing machines. (Q1401957) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\). (Q1853168) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)