Author:
Hoi Gordon,Jain Sanjay,Stephan Frank
Publisher
Springer International Publishing
Reference21 articles.
1. Byskov, J., Madsen, B., Skjernaa, B.: New algorithms for exact satisfiability. Theor. Comput. Sci. 332, 513–541 (2005)
2. Cook, S.: The complexity of theorem proving procedures. In: Third Annual ACM Symposium on Theory of Computing (STOC 1971), pp. 151–158 (1971)
3. Dahllöf, V.: Exact algorithms for exact satisfiability problems. Linköping Studies in Science and Technology, Ph.D. dissertation no 1013 (2006)
4. Dahllöf, V., Jonsson, P.: An algorithm for counting maximum weighted independent sets and its applications. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 292–298 (2002)
5. Dahllöf, V., Jonsson, P., Beigel, R.: Algorithms for four variants of the exact satisfiability problem. Theor. Comput. Sci. 320(2–3), 373–394 (2004)