Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Ben-Sasson, E., Wigderson, A.: Short proofs are narrow-resolution made simple. Journal of the ACM (JACM) 48(2), 149–169 (2001)
2. Chvatal, V., Szemeredi, E.: Many hard examples for resolution. Journal of the ACM 35(4), 759–768 (1988)
3. Coja-Oghlan, A., Goerdt, A., Lanka, A., Schadlich, F.: Certifying unsatisfiability of random 2k-sat formulas using approximation techniques. In: Proc. of the 14th International Symposium on Fundamentals of Computation Theory (2003)
4. Feige, U.: Relations between average case complexity and approximation complexity. In: Proc. of the 34th Annual ACM Symposium on Theory of Computing, pp. 534–543 (2002)
5. Feige, U., Ofek, E.: Spectral techniques applied to sparse random graphs. Technical report, Weizmann Institute of Science (2003)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献