Author:
Velev Miroslav N,Bryant Randal E
Subject
Computational Mathematics,Algebra and Number Theory
Reference87 articles.
1. Solvable Cases of the Decision Problem;Ackermann,1954
2. Aloul, F.A., Markov, I.L., Sakallah, K.A., 2001. Faster SAT and smaller BDDs via common function structure. International Conference on Computer-aided Design (ICCAD’01). pp. 443–448
3. Baptista, L., Marques-Silva, J.P., 2000. Using randomization and learning to solve hard real-world instances of satisfiability. Principles and Practice of Constraint Programming (CP’00). Available from: http://sat.inesc.pt/~jpms
4. Bayardo, R.J., Schrag, R., 1997. Using CSP look-back techniques to solve real world SAT instances. 14th National Conference on Artificial Intelligence (AAAI’97). pp. 203–208
5. Bentley, B., 2001. Validating the Intel® Pentium® 4 microprocessor. 38th Design Automation Conference (DAC’01). pp. 244–248
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献