Author:
Aguirre Alfonso San Miguel,Vardi MosheY.
Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. D. Achlioptas. Setting two variables at a time yields a new lower bound for random 3-SAT. In Proc. 32th ACM Symp. on Theory of Computing, pages 28–37, 2000.
2. J. Balcazar. Self-reducibility. Journal of Computer and System Sciences, 41(3):367–388, 1990.
3. P. Beame, R. M. Karp, T. Pitassi, and M. E. Saks. On the complexity of unsatisfiability proofs for random k-CNF formulas. In Proc. 30th ACM Symp. on Theory of Computing, pages 561–571, 1998.
4. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. 36th Conf. on Design Automation, pages 317–320, 1999.
5. M. Block, C. Gröpl, H. Preu\, H. L. Proömel, and A. Srivastav. Efficient ordering of state variables and transition relation partitions in symbolic model checking. Technical report, Institute of Informatics, Humboldt University of Berlin, 1997.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献