Pages that link to "Item:Q2537313"
From MaRDI portal
The following pages link to Relationships between nondeterministic and deterministic tape complexities (Q2537313):
Displaying 50 items.
- \textsc{Pull} and \textsc{PushPull} are PSPACE-complete (Q266272) (← links)
- On the complexity of existence of homing sequences for nondeterministic finite state machines (Q300305) (← links)
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- On selective unboundedness of VASS (Q355513) (← links)
- Extending inclusion dependencies with conditions (Q386615) (← links)
- The complexity of rerouting shortest paths (Q392173) (← links)
- Evaluation of permanents in rings and semirings (Q407582) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- Complexity of independent set reconfigurability problems (Q441866) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
- Two-way automata making choices only at the endmarkers (Q476168) (← links)
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
- Complexity of fixed-size bit-vector logics (Q504997) (← links)
- Alternating space is closed under complement and other simulations for sublogarithmic space (Q515583) (← links)
- CNF and DNF succinct graph encodings (Q515682) (← links)
- Regular languages viewed from a graph-theoretic perspective (Q515689) (← links)
- Collaborative planning with confidentiality (Q540688) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- On the computational complexity of membrane systems (Q596128) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- On the complexity of reconfiguration problems (Q631762) (← links)
- Recurrence and transience for finite probabilistic tables (Q631776) (← links)
- The complexity of temporal logic over the reals (Q636345) (← links)
- The depth of resolution proofs (Q647405) (← links)
- A note on algebras of languages (Q650885) (← links)
- On the computational complexity of behavioral description-based web service composition (Q650907) (← links)
- An improved time-space lower bound for tautologies (Q652633) (← links)
- Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) (← links)
- Interval logics and their decision procedures. I: An interval logic (Q671639) (← links)
- Reversible simulation of space-bounded computations (Q673645) (← links)
- Decreasing the bandwidth of a transition matrix (Q673904) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Recursively indefinite databases (Q688672) (← links)
- Feasibility analysis of sporadic real-time multiprocessor task systems (Q692625) (← links)
- On the contribution of backward jumps to instruction sequence expressiveness (Q692892) (← links)
- Non-determinism in Gödel's system \(T\) (Q693050) (← links)
- Rewriting of regular expressions and regular path queries (Q696951) (← links)
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- Inclusion dependencies and their interaction with functional dependencies in SQL (Q730506) (← links)
- Efficient model checking for LTL with partial order snapshots (Q732005) (← links)
- Procedural languages for database queries and updates (Q751799) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
