Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
From MaRDI portal
Cited in
(26)- Relativized alternation and space-bounded computation
- On finding a minimum dominating set in a tournament
- On the relation between ambiguity and nondeterminism in finite automata
- Nondeterministics circuits, space complexity and quasigroups
- Space-efficient recognition of sparse self-reducible languages
- On problems with short certificates
- The minimum equivalent DNF problem and shortest implicants
- Monotone Boolean dualization is in co-NP\([\log^{2}n]\).
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
- On the space and circuit complexity of parameterized problems: classes and completeness
- Bounded fixed-parameter tractability and reducibility
- Measuring nondeterminism in pushdown automata
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits
- Polynomial-time reducibilities and ``almost all oracle sets
- The birth and early years of parameterized complexity
- In memoriam Chandra Kintala
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP
- Molecular computing, bounded nondeterminism, and efficient recursion
- Fault-tolerance and complexity (extended abstract)
- The complexity of manipulative attacks in nearly single-peaked electorates
- The emptiness problem for intersections of regular languages
- On quasilinear-time complexity theory
- Optimal advice
- The logics for the complexity classes with limited non-determinism
- On measuring nondeterminism in regular languages
- On the complexity of monotone dualization and generating minimal hypergraph transversals
This page was built for publication: Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893305)
