Equivalency reasoning to solve a class of hard SAT problems. (Q1589482)
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 1542287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalency reasoning to solve a class of hard SAT problems. |
scientific article; zbMATH DE number 1542287 |
Statements
Equivalency reasoning to solve a class of hard SAT problems. (English)
0 references
12 December 2000
0 references
Computational complexity
0 references
Automatic theorem proving
0 references
Davis-Putnam procedure
0 references
SAT
0 references
