Pages that link to "Item:Q955340"
From MaRDI portal
The following pages link to Structure identification of Boolean relations and plain bases for co-clones (Q955340):
Displaying 23 items.
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
- Boolean max-co-clones (Q494629) (← links)
- Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
- An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
- Bases for Boolean co-clones (Q1044708) (← links)
- Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems (Q2208255) (← links)
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
- Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin (Q2301362) (← links)
- Minimal distance of propositional models (Q2322705) (← links)
- Dichotomy on intervals of strong partial Boolean clones (Q2351515) (← links)
- What makes propositional abduction tractable (Q2389658) (← links)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
- Weak bases of Boolean co-clones (Q2448853) (← links)
- Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)
- (Q5092397) (← links)
- A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705) (← links)
- Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations (Q5864666) (← links)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)