Publisher
Springer Berlin Heidelberg
Reference42 articles.
1. Lecture Notes in Computer Science;A. Biere,1999
2. Lecture Notes in Computer Science;G.C. Gopalakrishnan,2004
3. Lecture Notes in Computer Science;N. Dershowitz,2005
4. Benedetti, M., Mangassarian, H.: QBF-based formal verification: Experience and perspectives. JSAT 5(1-4), 133–191 (2008)
5. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proc. 5th Annual ACM Symp. on Theory of Computing, pp. 1–9 (1973)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Standalone Tactics Using OpenTheory;Interactive Theorem Proving;2012