Author:
Calabro Chris,Impagliazzo Russell,Paturi Ramamohan
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)
2. Büning, H.K., Karpinski, M., Flögel, A.: Resolution for quantified boolean formulas. Information and Computation 117(1), 12–18 (1995)
3. Chen, H.: Existentially restricted quantified constraint satisfaction. Information and Computation 207(3), 369–388 (2009)
4. Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of unique k-sat: An isolation lemma for k-cnfs. Journal of Computer and Systems Sciences??74(3), 386???393 (2008);
5. Preliminary version in Proceedings of the Eighteenth IEEE Conference on Computational Complexity, pp. 135???144 (2003)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献