Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697)
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: Recognizing More Unsatisfiable Random k-SAT Instances Efficiently |
scientific article; zbMATH DE number 5029533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently |
scientific article; zbMATH DE number 5029533 |
Statements
Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (English)
0 references
1 June 2006
0 references
random structures
0 references
random satisfiability
0 references
spectral methods
0 references
0 references
0.9117286
0 references
0.90155184
0 references
0.8991336
0 references
0.89509195
0 references
0 references
0 references
