Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s009753970444096x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011639573 / rank | |||
Normal rank | |||
Latest revision as of 10:37, 30 July 2024
scientific article; zbMATH DE number 5029533
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
