Automatic Enumeration of Intervals of Partial Co-Clones
Computer scientists are curious about the complexity relationship between different kinds of NP-complete SAT problems. In order to understand the complexity relationship between SAT problems, we decided to correspond SAT problems to a kind of algebra called partial co-clones. Each SAT problem can be...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
Linköpings universitet, Institutionen för datavetenskap
2016
|
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-127982 |