The following pages link to (Q4128417):
Displaying 50 items.
- The complexity of intersecting finite automata having few final states (Q347114) (← links)
- Ordered vertex removal and subgraph problems (Q582090) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- The complexity of membership problems for circuits over sets of integers (Q861262) (← links)
- The binary network flow problem is logspace complete for P (Q914388) (← links)
- A P-complete graph partition problem (Q917313) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- The three-color and two-color Tantrix\(^{\text{TM}}\) rotation puzzle problems are NP-complete via parsimonious reductions (Q1041029) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- Parallelism and the maximal path problem (Q1098641) (← links)
- The word and generator problems for lattices (Q1105626) (← links)
- How easy is local search? (Q1109573) (← links)
- Parallelism and the feedback vertex set problem (Q1111395) (← links)
- The logarithmic alternation hierarchy collapses: \(A\Sigma _ 2^{{\mathcal L}}=A\Pi_ 2^{{\mathcal L}}\) (Q1118407) (← links)
- On computing graph closures (Q1120287) (← links)
- A space efficient algorithm for the monotone planar circuit value problem (Q1133895) (← links)
- Number of quantifiers is better than number of tape cells (Q1164622) (← links)
- The maximum flow problem is log space complete for P (Q1165000) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- Properties that characterize LOGCFL (Q1176109) (← links)
- \(\Delta{} ^ p_ 2\)-complete lexicographically first maximal subgraph problems (Q1177173) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Finding the closed partition of a planar graph (Q1322561) (← links)
- A theory of strict P-completeness (Q1337145) (← links)
- On the computational complexity of graph closures (Q1351617) (← links)
- Parallel evaluation of arithmetic circuits (Q1365929) (← links)
- A recognition and parsing algorithm for arbitrary conjunctive grammars. (Q1401337) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- Balancing bounded treewidth circuits (Q1678757) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- TANTRIX\(^{\text{TM}}\) rotation puzzles are intractable (Q1765243) (← links)
- Module checking (Q1854407) (← links)
- On the computational complexity of data flow analysis over finite bounded meet semilattices (Q1981765) (← links)
- On the complexity of asynchronous freezing cellular automata (Q2051787) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- On the complexity of the stability problem of binary freezing totalistic cellular automata (Q2201794) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- Matchstick puzzles on a grid (Q2308506) (← links)
- Games for active XML revisited (Q2402614) (← links)
- Graph isomorphism, color refinement, and compactness (Q2410688) (← links)
- The complexity of agent design problems: Determinism and history dependence (Q2502156) (← links)
- The Monotone Circuit Value Problem with Bounded Genus Is in NC (Q2817851) (← links)
- On the Structure of Solution-Graphs for Boolean Formulas (Q2947874) (← links)
- On the Parameterized Parallel Complexity and the Vertex Cover Problem (Q2958339) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions (Q3540099) (← links)
