The following pages link to (Q4131648):
Displayed 50 items.
- Three \(\sum^ P_ 2\)-complete problems in computational learning theory (Q685716) (← links)
- Minimizing finite automata is computationally hard (Q703578) (← links)
- Synchronous Kleene algebra (Q710676) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- On the shortest path game (Q729795) (← links)
- Deciding the inequivalence of context-free grammars with 1-letter terminal alphapet is \(\sum ^ p_ 2\)-complete (Q761043) (← links)
- Optimizing the region algebra is PSPACE-complete (Q765502) (← links)
- Finite complete rewriting systems and the complexity of word problem (Q791314) (← links)
- Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Q793017) (← links)
- On the complexity of LL(k) testing (Q794445) (← links)
- Prohibiting repetitions makes playing games substantially harder (Q794942) (← links)
- The complexity of two-player games of incomplete information (Q800838) (← links)
- Backtracking games and inflationary fixed points (Q817842) (← links)
- On the complexity of timed pattern matching (Q832025) (← links)
- State complexity of projection on languages recognized by permutation automata and commuting letters (Q832938) (← links)
- On the complexity of kings (Q846367) (← links)
- The complexity of membership problems for circuits over sets of integers (Q861262) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Extended RDF: computability and complexity issues (Q905991) (← links)
- CCS expressions, finite state processes, and three problems of equivalence (Q918211) (← links)
- New complexity results about Nash equilibria (Q932810) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- A new 3-CNF transformation by parallel-serial graphs (Q976123) (← links)
- Succinctness of regular expressions with interleaving, intersection and counting (Q982670) (← links)
- Satisfiability of algebraic circuits over sets of natural numbers (Q987688) (← links)
- A self-adaptive multi-engine solver for quantified Boolean formulas (Q1020496) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- On self-reducibility and weak P-selectivity (Q1054475) (← links)
- On the complexity of chess (Q1054641) (← links)
- On classes of tractable unrestricted regular expressions (Q1061498) (← links)
- PSPACE-Hardness of some combinatorial games (Q1090274) (← links)
- The complexity of combinatorial problems with succinct input representation (Q1090455) (← links)
- Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n)\(\neq NSPACE(\log \,n)\) (Q1094139) (← links)
- Succinct representation of regular sets using gotos and Boolean variables (Q1101207) (← links)
- More complicated questions about maxima and minima, and some closures of NP (Q1107524) (← links)
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- Non-elementary lower bound for Propositional Duration Calculus (Q1129106) (← links)
- The emptiness of complement problem for semi extended regular expressions requires \(c^n\) space (Q1134514) (← links)
- Complexity of Boolean algebras (Q1137036) (← links)
- Hex ist Pspace-vollständig. (Hex is Pspace-complete) (Q1138494) (← links)
- Tree-size bounded alternation (Q1145502) (← links)
- Observations on the complexity of regular expression problems (Q1149249) (← links)
- Optimization problems and the polynomial hierarchy (Q1152218) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- On time-space classes and their relation to the theory of real addition (Q1155607) (← links)
- Playing disjunctive sums is polynomial space complete (Q1159098) (← links)