The following pages link to (Q4131648):
Displayed 50 items.
- 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)
- The complexity of logical theories (Q1159661) (← links)
- The complexity of computing the number of strings of given length in context-free languages (Q1178713) (← links)
- A note on the space complexity of some decision problems for finite automata (Q1183428) (← links)
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems (Q1185244) (← links)
- The parallel complexity of finite-state automata problems (Q1186807) (← links)
- Computational complexity of winning strategies in two-person polynomial games (Q1190954) (← links)
- A guide to completeness and complexity for modal logics of knowledge and belief (Q1193476) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games (Q1196208) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- On tape-bounded complexity classes and multihead finite automata (Q1215271) (← links)
- Space-bounded reducibility among combinatorial problems (Q1221749) (← links)
- A comparison of polynomial time reducibilities (Q1223166) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- A characterization of the power of vector machines (Q1232182) (← links)
- The covering problem for linear context-free grammars (Q1232301) (← links)
- Complete problems for deterministic polynomial time (Q1235982) (← links)
- The polynomial-time hierarchy (Q1236109) (← links)
- Complexity of some problems in Petri nets (Q1238999) (← links)