On the strength of uniqueness quantification in primitive positive formulas
From MaRDI portal
Publication:5092397
DOI10.4230/LIPICS.MFCS.2019.36MaRDI QIDQ5092397FDOQ5092397
Authors: Victor Lagerkvist, Gustav Nordh 
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1906.07031
Recommendations
Cites Work
- Complexity classifications of Boolean constraint satisfaction problems
- Function Algebras on Finite Sets
- On the complexity of \(k\)-SAT
- On the algebraic structure of combinatorial problems
- The algebras of partial functions and their invariants
- Complexity of generalized satisfiability counting problems
- Closed systems of functions and predicates
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- Structure identification of Boolean relations and plain bases for co-clones
- The complexity of facets (and some facets of complexity)
- The Inverse Satisfiability Problem
- Weak bases of Boolean co-clones
- Partial Polymorphisms and Constraint Satisfaction Problems
- Title not available (Why is that?)
- On the unique satisfiability problem
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
- Title not available (Why is that?)
- A dichotomy theorem for the inverse satisfiability problem
Cited In (2)
This page was built for publication: On the strength of uniqueness quantification in primitive positive formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092397)
