The complexity of the conservative generalized satisfiability problem
From MaRDI portal
Publication:1691631
zbMath1378.68065MaRDI QIDQ1691631
Publication date: 24 January 2018
Published in: Doklady Mathematics (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30)
Related Items (2)
Constraint Satisfaction Problems Solvable by Local Consistency Methods ⋮ Complexity of the satisfiability problem for multilinear forms over a finite field
This page was built for publication: The complexity of the conservative generalized satisfiability problem
