Author:
Hoi Gordon,Jain Sanjay,Schwarz Sibylle,Stephan Frank
Publisher
Springer International Publishing
Reference14 articles.
1. Accorsi, R.: MAX2SAT is NP-complete. WINS-ILLC, University of Amsterdam (1999)
2. Chen, H.: A rendezvous of logic, complexity, and algebra. SIGACT News (Logic Column). ACM (2006)
3. Gaspers, S., Sorkin, G.B.: Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. ACM Trans. Algorithms (TALG) 13(4), 44:1–44:36 (2017)
4. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)
5. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85–103. Springer, Boston (1972).
https://doi.org/10.1007/978-1-4684-2001-2_9