The following pages link to Bases for Boolean co-clones (Q1044708):
Displaying 23 items.
- Boolean max-co-clones (Q494629) (← links)
- Trichotomies in the complexity of minimal inference (Q692908) (← links)
- On Boolean primitive positive clones (Q932583) (← links)
- Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Lewis dichotomies in many-valued logics (Q1935553) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- On the complexity of the clone membership problem (Q2048213) (← links)
- Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255) (← links)
- The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis (Q2272200) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- Weak bases of Boolean co-clones (Q2448853) (← links)
- As Close as It Gets (Q2803825) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- (Q4553280) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)
- The Next Whisky Bar (Q5740176) (← links)
- The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)
