A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT (Q4608627)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT |
scientific article; zbMATH DE number 6851897
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT |
scientific article; zbMATH DE number 6851897 |
Statements
21 March 2018
0 references
clone theory
0 references
universal algebra
0 references
satisfiability problems
0 references
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT (English)
0 references
