A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT

DOI10.4230/LIPIcs.MFCS.2016.64zbMath1398.68253OpenAlexW2548856372MaRDI QIDQ4608627

Victor Lagerkvist, Biman Roy

Publication date: 21 March 2018

Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2016.html#LagerkvistR16

zbMATH Keywords

universal algebrasatisfiability problemsclone theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT