Pages that link to "Item:Q1221749"
From MaRDI portal
The following pages link to Space-bounded reducibility among combinatorial problems (Q1221749):
Displaying 50 items.
- Deciding determinism of regular languages (Q493651) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Infinite games with finite knowledge gaps (Q528188) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- Decision problems for convex languages (Q553302) (← links)
- Descriptional and computational complexity of finite automata -- a survey (Q553312) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- A note on algebras of languages (Q650885) (← links)
- Distributed XML design (Q657904) (← links)
- Knapsack problems for NL (Q673615) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
- Methods for proving completeness via logical reductions (Q685391) (← links)
- Rewriting of regular expressions and regular path queries (Q696951) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- On the complexity of topological sorting (Q750150) (← links)
- Prediction-preserving reducibility (Q756441) (← links)
- Bandwidth constraints on problems complete for polynomial time (Q791316) (← links)
- The complexity of two-player games of incomplete information (Q800838) (← links)
- Infinity problems and countability problems for \(\omega \)-automata (Q845856) (← links)
- The complexity of pure literal elimination (Q862401) (← links)
- Boundary sets of regular and context-free languages (Q896680) (← links)
- Endmarkers can make a difference (Q911789) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
- Complete problems for space bounded subclasses of NP (Q1064779) (← links)
- An analysis of the nonemptiness problem for classes of reversal-bounded multicounter machines (Q1094140) (← links)
- Simultaneous (poly-time, log-space) lower bounds (Q1102116) (← links)
- Alternating multihead finite automata (Q1116353) (← links)
- Characterization of idempotent transformation monoids (Q1119394) (← links)
- Problems concerning fairness and temporal logic for conflict-free Petri nets (Q1121023) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- The complexity of decision problems for finite-turn multicounter machines (Q1151753) (← links)
- Number of quantifiers is better than number of tape cells (Q1164622) (← links)
- Symmetric space-bounded computation (Q1167537) (← links)
- On eliminating nondeterminism from Turing machines which use less than logarithm worktape space (Q1168735) (← links)
- On the computational complexity of satisfiability in propositional logics of programs (Q1170028) (← links)
- Unifiability is complete for co-N Log Space (Q1173403) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- Iterated stack automata and complexity classes (Q1183602) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- A very hard log-space counting class (Q1208403) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- Complete problems for deterministic polynomial time (Q1235982) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- Complexity of some problems in Petri nets (Q1238999) (← links)
- Corrigendum: Space-bounded reducibility among combinatorial problems (Q1239725) (← links)
- Complete sets and the polynomial-time hierarchy (Q1241440) (← links)
- On inverse deterministic pushdown transductions (Q1245575) (← links)
