The following pages link to (Q4354427):
Displaying 42 items.
- On the applicability of Post's lattice (Q436335) (← links)
- The complexity of satisfiability for fragments of hybrid logic. I. (Q631087) (← links)
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- Recognizing frozen variables in constraint satisfaction problems (Q706617) (← links)
- \(H\)-coloring dichotomy revisited (Q817769) (← links)
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Composition of Post classes and normal forms of Boolean functions (Q856872) (← links)
- On some enumerative aspects of generalized associahedra (Q875058) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- On a quasi-ordering on Boolean functions (Q924135) (← links)
- On Boolean primitive positive clones (Q932583) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- Generalized modal satisfiability (Q988571) (← links)
- Information loss in knowledge compilation: a comparison of Boolean envelopes (Q991010) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Bases for Boolean co-clones (Q1044708) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Toward a generalized computability theory (Q1346903) (← links)
- The theory of computability developed in terms of satisfaction (Q1347606) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- The concept of computability (Q1434377) (← links)
- Definability of Boolean function classes by linear equations over \(\mathbf{GF}(2)\) (Q1878398) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- Turing computability: structural theory (Q2036465) (← links)
- Enumerating teams in first-order team logics (Q2172832) (← links)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes (Q2387440) (← links)
- Sequential? (Q2490822) (← links)
- Parameterized Complexity of CTL (Q2799205) (← links)
- The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I (Q3182957) (← links)
- The Foundations of Computability Theory (Q3459045) (← links)
- (Q3582626) (← links)
- THE COMPLEXITY OF SATISFIABILITY FOR FRAGMENTS OF CTL AND CTL⋆ (Q3646173) (← links)
- The Complexity of Satisfiability for Fragments of CTL and CTL⋆ (Q4982095) (← links)
- The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments (Q4982126) (← links)
- The Foundations of Computability Theory (Q5139272) (← links)
- Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Parameterised complexity of model checking and satisfiability in propositional dependence logic (Q5918486) (← links)
- Temporal team semantics revisited (Q6649479) (← links)
