Author:
Goliaei Sama,Jalili Saeed
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press (2001)
2. Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151–158. ACM (1971)
3. Baier, C., Katoen, J.P., Larsen, K.G.: Principles of Model Checking. The MIT Press (2008)
4. Ganai, M., Gupta, A.: SAT-Based Scalable Formal Verification Solutions, 1st edn. Springer (2007)
5. Paturi, R., Pudlak, P.: On the complexity of circuit satisfiability. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 241–250. ACM (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献