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 the normal view instead:
scientific article; zbMATH DE number 6851897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8371244668960571
0 references
0.8185660243034363
0 references
0.8156956434249878
0 references
0.8067863583564758
0 references
0.7905945181846619
0 references
