An algorithm for the satisfiability problem of formulas in conjunctive normal form (Q4651809): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 17:29, 7 February 2024
scientific article; zbMATH DE number 2136074
Language | Label | Description | Also known as |
---|---|---|---|
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