| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 435519 | Theoretical Computer Science | 2009 | 6 Pages |
Abstract
We show that many NP-hard sets have heuristic polynomial-time algorithms with high probability weight of correctness with respect to generalizations of Procaccia and Rosenschein’s junta distributions.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
