The following pages link to Making Nondeterminism Unambiguous (Q4943859):
Displaying 46 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Is Valiant-Vazirani's isolation probability improvable? (Q354652) (← links)
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Green's theorem and isolation in planar graphs (Q714498) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- \textsc{ReachFewL} = \textsc{ReachUL} (Q744612) (← links)
- Positive and negative proofs for circuits and branching programs (Q896677) (← links)
- Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones (Q1285764) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits (Q1892887) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- String shuffle: circuits and graphs (Q2018545) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- On expressive power of regular realizability problems (Q2262977) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Dual VP classes (Q2410687) (← links)
- Complexity Theory Basics: NP and NL (Q2821692) (← links)
- Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs (Q2821694) (← links)
- Nondeterminism through well-founded choice (Q3128614) (← links)
- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace (Q3191145) (← links)
- (Q3316559) (← links)
- Towards separating nondeterminism from determinism (Q3334987) (← links)
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size (Q3541802) (← links)
- Trading determinism for time in space bounded computations (Q4608568) (← links)
- NL-printable sets and Nondeterministic Kolmogorov Complexity (Q4924524) (← links)
- (Q4993594) (← links)
- (Q5002753) (← links)
- An unambiguous class possessing a complete set (Q5048936) (← links)
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- (Q5092325) (← links)
- (Q5216300) (← links)
- Derandomizing Isolation in Space-Bounded Settings (Q5232318) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- ON THE MINIMAL POLYNOMIAL OF A MATRIX (Q5696967) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata (Q6173104) (← links)
- Unambiguous and co-nondeterministic computations of finite automata and pushdown automata families and the effects of multiple counters (Q6636064) (← links)
