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.
- Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
- The complexity of monadic recursion schemes: executability problems, nesting depth, and applications (Q792758) (← links)
- The complexity of two-player games of incomplete information (Q800838) (← links)
- The propositional dynamic logic of deterministic, well-structured programs (Q801682) (← links)
- On oblivious branching programs of linear length (Q804285) (← links)
- Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
- Integrally closed residuated lattices (Q831226) (← links)
- Runtime monitors for Markov decision processes (Q832291) (← links)
- Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective (Q843994) (← links)
- Generalized Pete's Pike is PSPACE-complete (Q899314) (← links)
- Topological invariants of classification problems (Q908698) (← links)
- Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
- New developments in structural complexity theory (Q913509) (← links)
- If deterministic and nondeterministic space complexities are equal for log log n, then they are also equal for log n (Q914371) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- On the convergence of query evaluation (Q919818) (← links)
- The difference between one tape and two tapes: With respect to reversal complexity (Q920983) (← links)
- The complexity of deciding reachability properties of distributed negotiation schemes (Q924139) (← links)
- Incremental branching programs (Q929291) (← links)
- Reversal complexity revisited (Q935164) (← links)
- Automata can show PSpace results for description logics (Q948069) (← links)
- On regular temporal logics with past (Q977176) (← links)
- A Rice-style theorem for parallel automata (Q1004287) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528) (← links)
- On the computational complexity of the languages of general symbolic dynamical systems and beta-shifts (Q1034609) (← links)
- Detecting palindromes, patterns and borders in regular languages (Q1041028) (← links)
- The complexity of finding minimum-length generator sequences (Q1058290) (← links)
- A multiprocess network logic with temporal and spatial modalities (Q1058846) (← links)
- Consistency in nondeterministic storage (Q1060847) (← links)
- Complete problems for space bounded subclasses of NP (Q1064779) (← links)
- On some natural complete operators (Q1064780) (← links)
- On two problems related to cancellativity (Q1070349) (← links)
- Inclusion dependencies and their interaction with functional dependencies (Q1071523) (← links)
- Complexity results on the conjugacy problem for monoids (Q1073015) (← links)
- On bounded query machines (Q1085975) (← links)
- Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\) (Q1094139) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- Relating the power of cellular arrays to their closure properties (Q1104098) (← links)
- Relativized alternation and space-bounded computation (Q1111024) (← links)
- White pebbles help (Q1111025) (← links)
- On a complexity hierarchy between L and NL (Q1114402) (← links)
- A measure of relativized space which is faithful with respect to depth (Q1115190) (← links)
- The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) (Q1118407) (← links)
- A note on the best-case complexity (Q1120281) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
