| Title: |
On the Complexity of Random Satisfiability Problems with Planted Solutions |
| Article URLs: |
|
| Alternative Article URLs: |
|
| Authors: |
Vitaly Feldman |
-
IBM Research - Almaden 650 Harry rd. San Jose, CA 95120
|
| Will Perkins |
-
University of Birmingham Edgbaston, Birmingham B15 2TT, England
|
| Santosh S. Vempala |
-
Georgia Tech 266 Ferst Drive Atlanta, GA 30332
|
| Sharing: |
Unknown
|
| Verification: |
Authors have
not verified
information
|
| Artifact Evaluation Badge: |
none
|
| Artifact URLs: |
|
| Artifact Correspondence Email Addresses: |
|
| NSF Award Numbers: |
1217793
|
| DBLP Key: |
conf/stoc/FeldmanPV15
|
| Author Comments: |
|