The following pages link to (Q4058132):
Displaying 50 items.
- The polynomial-time hierarchy (Q1236109) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Reflective relational machines (Q1271557) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Succinctness as a source of complexity in logical formalisms (Q1302307) (← links)
- Context-sensitive transitive closure operators (Q1319508) (← links)
- Logical and schematic characterization of complexity classes (Q1323362) (← links)
- Invariance properties of RAMs and linear time (Q1327595) (← links)
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures (Q1336623) (← links)
- Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
- Recursion theoretic characterizations of complexity classes of counting functions (Q1365942) (← links)
- MNP: A class of NP optimization problems (Q1368182) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Metafinite model theory (Q1383163) (← links)
- 0-1 laws by preservation (Q1390939) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Distinguishing string selection problems. (Q1427861) (← links)
- Counting problems over the reals (Q1575534) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Expressiveness of concept expressions in first-order description logics (Q1606296) (← links)
- On second-order generalized quantifiers and finite structures (Q1612478) (← links)
- Existential monadic second order logic on random rooted trees (Q1618231) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
- Efficient solutions for the far from most string problem (Q1761847) (← links)
- Logic, semigroups and automata on words (Q1817074) (← links)
- Structure and complexity of relational queries (Q1838840) (← links)
- Complexity and expressive power of deterministic semantics for DATALOG\(^ \neg\). (Q1854304) (← links)
- Functional queries in datalog (Q1862647) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Closure properties of locally finite \(\omega\)-languages (Q1885033) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- The computational complexity of approximating the minimal perturbation scaling to achieve instability in an interval matrix (Q1894653) (← links)
- Directions in generalized quantifier theory (Q1908858) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Coherence and computational complexity of quantifier-free dependence logic formulas (Q1956380) (← links)
- Max NP-completeness made easy (Q1960655) (← links)
- On the hardness of maximum rank aggregation problems (Q2018536) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- ASNP: a tame fragment of existential second-order logic (Q2106601) (← links)
- Computation on structures. Behavioural theory, logic, complexity (Q2117601) (← links)
- A logical characterization of constant-depth circuits over the reals (Q2148775) (← links)
- Enumerating teams in first-order team logics (Q2172832) (← links)
