An algorithm for the satisfiability problem of formulas in conjunctive normal form (Q4651809)
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 2136074
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for the satisfiability problem of formulas in conjunctive normal form |
scientific article; zbMATH DE number 2136074 |
Statements
An algorithm for the satisfiability problem of formulas in conjunctive normal form (English)
0 references
22 February 2005
0 references
Complexity theory
0 references
NP-completeness
0 references
CNF-SAT
0 references
Probabilistic algorithms
0 references
0.8852740526199341
0 references
0.863864004611969
0 references
0.8588425517082214
0 references
