Pages that link to "Item:Q3821586"
From MaRDI portal
The following pages link to Nondeterministic Space is Closed under Complementation (Q3821586):
Displaying 50 items.
- The complexity of the exponential output size problem for top-down and bottom-up tree transducers (Q1854455) (← links)
- Alternating and empty alternating auxiliary stack automata. (Q1874397) (← links)
- Bounded MSC communication (Q1881218) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- A note on logspace optimization (Q1904668) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← 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)
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (Q2009642) (← links)
- A trichotomy for regular simple path queries on graphs (Q2009646) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- Clocked population protocols (Q2040025) (← links)
- Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
- On verification of D-detectability for discrete event systems (Q2065231) (← links)
- Varieties (Q2074217) (← links)
- Traversability, reconfiguration, and reachability in the gadget framework (Q2154080) (← links)
- On expressive power of regular realizability problems (Q2262977) (← links)
- The complexity of graph languages generated by hyperedge replacement (Q2277851) (← links)
- Unique decipherability in formal languages (Q2283038) (← links)
- Orbit expandability of automaton semigroups and groups (Q2290646) (← links)
- On Boolean combinations forming piecewise testable languages (Q2358689) (← links)
- On the complexity of the word problem for automaton semigroups and automaton groups (Q2363312) (← links)
- An efficiently solvable graph partition problem to which many problems are reducible (Q2365814) (← links)
- Collapsing degrees via strong computation (Q2366690) (← links)
- On lower bounds for read-\(k\)-times branching programs (Q2366719) (← links)
- NL-printable sets and nondeterministic Kolmogorov complexity (Q2369009) (← links)
- Computation in networks of passively mobile finite-state sensors (Q2375293) (← links)
- Bounds in ontology-based data access via circuit complexity (Q2411040) (← links)
- Parallelizing time with polynomial circuits (Q2429726) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems (Q2503275) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- Self-reducibility (Q2639637) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Complementing two-way finite automata (Q2643079) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- On the unusual effectiveness of logic in computer science (Q2736585) (← links)
- The constraint satisfaction problem and universal algebra (Q2795309) (← links)
- Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space (Q2817388) (← links)
- Complexity Theory Basics: NP and NL (Q2821692) (← links)
- Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs (Q2821694) (← links)
- A Logical Characterization of Small 2NFAs (Q2830217) (← links)
- Turing Machines for Dummies (Q2891358) (← links)
- Inherent Vacuity in Lattice Automata (Q2947173) (← links)
- Inconsistency-Tolerant Querying of Description Logic Knowledge Bases (Q2970304) (← links)
- Optimal Reachability in Divergent Weighted Timed Games (Q2988366) (← links)
- Planarity Testing Revisited (Q3010433) (← links)
- Sublogarithmic $\sum _2$-space is not closed under complement and other separation results (Q3142269) (← links)
