Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Improving exhaustive search implies superpolynomial lower bounds | SIAM Journal on Computing |
| 2013 | |
Guest column | ACM SIGACT News | 5 | 2011 | |
Short PCPPs verifiable in polylogarithmic time with O(1) queries | Annals of Mathematics and Artificial Intelligence |
| 8 | 2009 |
On the Power of Small-Depth Computation | Foundations and Trends® in Theoretical Computer Science |
| 9 | 2009 |
A Survey of Lower Bounds for Satisfiability and Related Problems | Foundations and Trends® in Theoretical Computer Science |
| 14 | 2006 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Bounded depth circuits with weighted symmetric gates: Satisfiability, lower bounds and compression | Journal of Computer and System Sciences |
| 2019 |