The following pages link to (Q4131648):
Displayed 50 items.
- 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)
- Complete sets and the polynomial-time hierarchy (Q1241440) (← links)
- Log space machines with multiple oracle tapes (Q1242686) (← links)
- On the complexity of some two-person perfect-information games (Q1248466) (← links)
- On log-tape isomorphisms of complete sets (Q1249940) (← links)
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas (Q1254112) (← links)
- Gobang is PSPACE-complete (Q1255445) (← links)
- Propositional dynamic logic of regular programs (Q1258296) (← links)
- Bounding queries in the analytic polynomial-time hierarchy (Q1274987) (← links)
- Sentences over integral domains and their computational complexities (Q1286369) (← links)
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics (Q1329742) (← links)
- Separation of complexity classes in Koiran's weak model (Q1338212) (← links)
- The complexity of PDL with interleaving (Q1351943) (← links)
- Complexity of equivalence problems for concurrent systems of finite agents (Q1383143) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- Fast algorithms for revision of some special propositional knowledge bases (Q1415946) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- A complexity analysis of bisimilarity for value-passing processes (Q1575255) (← links)
- Efficient implementation of regular languages using reversed alternating finite automata (Q1575901) (← links)
- Complexity-theoretic models of phase transitions in search problems (Q1583531) (← links)
- Implementing automata. Selected papers from the 2nd international workshop, WIA '97, Univ. of Western Ontario, London, Ontario, Canada, September 18--20, 1997 (Q1586200) (← links)
- Decision algorithms for multiplayer noncooperative games of incomplete information (Q1609052) (← links)
- The presence of a zero in an integer linear recurrent sequence is NP-hard to decide (Q1611897) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Domino-tiling games (Q1822501) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Fair simulation (Q1854506) (← links)
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229) (← links)
- Is your model checker on time? On the complexity of model checking for timed modal logics (Q1858436) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Equivalence problems for circuits over sets of natural numbers (Q2268343) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)