Making Nondeterminism Unambiguous
From MaRDI portal
Recommendations
Cited in
(48)- Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones
- Approximation of boolean functions by combinatorial rectangles
- The complexity of planarity testing
- Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace
- Isolation, matching, and counting uniform and nonuniform upper bounds
- On arithmetic branching programs
- String shuffle: circuits and graphs
- Depth-first search in directed planar graphs, revisited
- On expressive power of regular realizability problems
- NL-printable sets and nondeterministic Kolmogorov complexity
- Dual VP classes
- Complexity theory basics: NP and NL
- Space complexity of the directed reachability problem over surface-embedded graphs
- Deterministic logics for UL
- Nondeterminism through well-founded choice
- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace
- scientific article; zbMATH DE number 3846839 (Why is no real title available?)
- Towards separating nondeterminism from determinism
- Zero-information protocols and unambiguity in Arthur-Merlin communication
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
- Is Valiant-Vazirani's isolation probability improvable?
- Log-space algorithms for paths and matchings in k-trees
- Space complexity of perfect matching in bounded genus bipartite graphs
- Trading determinism for time in space bounded computations
- NL-printable sets and nondeterministic Kolmogorov complexity
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- An unambiguous class possessing a complete set
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
- Compressed Decision Problems in Hyperbolic Groups.
- Typically-correct derandomization for small time and space
- scientific article; zbMATH DE number 7561616 (Why is no real title available?)
- Descriptive complexity for counting complexity classes
- Derandomizing isolation in space-bounded settings
- Two-way unary automata versus logarithmic space
- Unambiguity in automata theory
- ON THE MINIMAL POLYNOMIAL OF A MATRIX
- Investigations on automata and languages over a unary alphabet
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata
- Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters
- Inductive tracing and the complexity of finding Hamiltonian path in DAGs
- Green's theorem and isolation in planar graphs
- Unambiguous, randomized, and symmetric catalytic computation
- Planar and grid graph reachability problems
- \textsc{ReachFewL} = \textsc{ReachUL}
- Positive and negative proofs for circuits and branching programs
This page was built for publication: Making Nondeterminism Unambiguous
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943859)
