An algorithm for the satisfiability problem of formulas in conjunctive normal form (Q4651809): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jalgor.2004.04.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067983896 / rank | |||
Normal rank | |||
Latest revision as of 19:07, 19 March 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
