Complexity of satisfiability problems with symmetric polynomial clauses
From MaRDI portal
Recommendations
Cited in
(9)- Polynomial-average-time satisfiability problems
- A perspective on certain polynomial-time solvable classes of satisfiability
- Complexity of generalized satisfiability counting problems
- Recognition of tractable satisfiability problems through balanced polynomial representations
- A Polly Cracker system based on satisfiability
- About some UP-based polynomial fragments of SAT
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
- Complexity of the satisfiability problem for multilinear forms over a finite field
This page was built for publication: Complexity of satisfiability problems with symmetric polynomial clauses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344698)