Computationally hard problems: 3-SAT and its polynomial solvability (Q2888335)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computationally hard problems: 3-SAT and its polynomial solvability |
scientific article; zbMATH DE number 6039818
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computationally hard problems: 3-SAT and its polynomial solvability |
scientific article; zbMATH DE number 6039818 |
Statements
30 May 2012
0 references
3-SAT problem
0 references
literal
0 references
logical consequents
0 references
0.9035304
0 references
0.9004396
0 references
0.8958704
0 references
0.89101136
0 references
0 references
0.87943447
0 references
0.87765133
0 references
0.8766813
0 references
Computationally hard problems: 3-SAT and its polynomial solvability (English)
0 references
