The following pages link to Classes of bounded nondeterminism (Q3034815):
Displaying 20 items.
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- 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)
- A representable approach to finite nondeterminism (Q1391859) (← 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)
- (Q3782784) (← links)
- Unbounded Non-determinism in CSP (Q4276178) (← links)
- Molecular computing, bounded nondeterminism, and efficient recursion (Q4572009) (← links)
- Fault-tolerance and complexity (Extended abstract) (Q4630260) (← links)
- Resource-bounded kolmogorov complexity revisited (Q5047163) (← links)
- Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations (Q5047164) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191506) (← links)
- On log-time alternating Turing machines of alternation depth k (Q6085715) (← links)
