Pages that link to "Item:Q1221749"

The following pages link to Space-bounded reducibility among combinatorial problems (Q1221749):

Displaying 50 items.

• On the complexity of some two-person perfect-information games (Q1248466) (← links)
• On languages specified by relative acceptance (Q1249438) (← links)
• On log-tape isomorphisms of complete sets (Q1249940) (← links)
• Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
• The relative power of logspace and polynomial time reductions (Q1312179) (← links)
• On path equivalence of nondeterministic finite automata (Q1351166) (← links)
• Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
• On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330) (← links)
• A recognition and parsing algorithm for arbitrary conjunctive grammars. (Q1401337) (← links)
• Complexity of path discovery game problems (Q1566737) (← links)
• Hierarchical information and the synthesis of distributed strategies (Q1629748) (← links)
• Spanning the spectrum from safety to liveness (Q1629750) (← links)
• Balancing bounded treewidth circuits (Q1678757) (← links)
• On the computational complexity of problems related to distinguishability sets (Q1706155) (← links)
• On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159) (← links)
• Sorting, linear time and the satisfiability problem (Q1817067) (← links)
• Domino-tiling games (Q1822501) (← links)
• The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
• Entanglement and the complexity of directed graphs (Q1929212) (← links)
• Complexity of universality and related problems for partially ordered NFAs (Q2013561) (← links)
• Comparing the notions of opacity for discrete-event systems (Q2063098) (← links)
• Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
• Constrained synchronization and commutativity (Q2235741) (← links)
• Deciding definability by deterministic regular expressions (Q2361347) (← links)
• Concurrent reachability games (Q2465027) (← links)
• Prime languages (Q2514149) (← links)
• On linear languages recognized by deterministic biautomata (Q2672654) (← links)
• The complexity of searching implicit graphs (Q2676567) (← links)
• Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
• Inherent Vacuity in Lattice Automata (Q2947173) (← links)
• (Q3191148) (← links)
• The role of rudimentary relations in complexity theory (Q3347299) (← links)
• Note on the complexity of Las Vegas automata problems (Q3421911) (← links)
• The Simple Reachability Problem in Switch Graphs (Q3599094) (← links)
• Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
• Gradually intractable problems and nondeterministic log-space lower bounds (Q3700836) (← links)
• Classifying the computational complexity of problems (Q3781088) (← links)
• A note on context free languages, complexity classes, and diagonalization (Q3928245) (← links)
• Completeness for nondeterministic complexity classes (Q3979608) (← links)
• New problems complete for nondeterministic log space (Q4109298) (← links)
• Relativization of questions about log space computability (Q4109299) (← links)
• (Q4146255) (← links)
• The complexity of the membership problem for some extensions of context-free languagest† (Q4181980) (← links)
• (Q4603446) (← links)
• The complexity of searching succinctly represented graphs (Q4645179) (← links)
• Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
• The complexity of properties of transformation semigroups (Q4960463) (← links)
• (Q4988162) (← links)
• (Q4989409) (← links)
• (Q5015284) (← links)