| Title | A sharp threshold in proof complexity yields lower bounds for satisfiability search |
| Publication Type | Journal Article |
| Year of Publication | 2004 |
| Authors | Achlioptas D, Beame P, Molloy M |
| Journal | Journal of Computer and System Sciences |
| Volume | 68 |
| Pagination | 238–268 |
| Citation Key | abm:2+psat-journal:short |
