Author:
Impagliazzo Russell,Paturi Ramamohan
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference18 articles.
1. The Probabilistic Method;Alon,1992
2. 3-Coloring in time O(1.3446n) time: a no-MIS algorithm;Beigel,1995
3. Experimental results on the crossover point in random 3SAT;Crawford;Artificial Intelligence,1996
4. E. A. Hirsch, Two new upper bounds for SAT, in, SIAM Conference on Discrete Algorithms, 1997.
5. R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity, in 1998 Annual IEEE Symposium on Foundations of Computer Science, pp. 653–662.
Cited by
628 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献