scientific article; zbMATH DE number 7561680

DOI10.4230/LIPIcs.MFCS.2019.36MaRDI QIDQ5092397

Victor Lagerkvist, Gustav Nordh

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1906.07031

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

constraint satisfaction problemsclone theoryprimitive positive definitions

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Structure identification of Boolean relations and plain bases for co-clones
• The complexity of facets (and some facets of complexity)
• On the algebraic structure of combinatorial problems
• Complexity of generalized satisfiability counting problems
• Weak bases of Boolean co-clones
• Closed systems of functions and predicates
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• On the unique satisfiability problem
• The algebras of partial functions and their invariants
• The Inverse Satisfiability Problem
• A Dichotomy Theorem for the Inverse Satisfiability Problem
• Function Algebras on Finite Sets
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
• Partial Polymorphisms and Constraint Satisfaction Problems
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• On the complexity of \(k\)-SAT

This page was built for publication: