Author:
Goldberg Evgueni,Novikov Yakov
Reference21 articles.
1. L. Baptista, J.P. Marques-Silva. The Interplay of Randomization and Learning on Real-world Instances of Satisfiability. In: Proceedings of AAAI Workshop on Leveraging Probability and Uncertainty in Computation. July 2000.
2. R.J.J. Bayardo, R.C. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT Instances. In: Proceeding of the 14th National Conference on Artificial Intelligence (AAAI’97), Providence, Rhode Island, 1997, pp. 203–208.
3. E. Ben-Sasson, R. Impagliazzo, A. Wigderson. Near Optimal Separation of Treelike and General Resolution. In: Proceedings of SAT-2000: 3rd Workshop on the Satisfiability Problem. May 2000. pp. 14–18.
4. A. Biere, A. Cimatti, E.M. Clarke, M. Fujita, Y. Zhu. Symbolic Model Checking Using SAT Procedures Instead of BDDs. In: Proceedings of Design Automation Conference, DAC’99. 1999.
5. R.K. Brayton et al. Logic Minimization Algorithms for VLSI Synthesis. Kluwer Academic, 1984.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献