86 

 

[54] 

V. Arvind and P. P. Kurur, “Graph Isomorphism is in SPP,” Information and Computation, vol. 
204, no. 5, pp. 835–852, 2006, doi: 10.1016/j.ic.2006.02.002. 

[55] 

C. H. Papadimitriou and U. v Vazirani, “On two geometric problems related to the travelling 
salesman problem,” Journal of Algorithms, vol. 5, no. 2, pp. 231–246, 1984. 

[56] 

P. L. Jensen, “Integer factorization,” University of Copenhagen, 2005. 

[57] 

R. Beigel, “Bounded queries to SAT and the Boolean hierarchy,” Theor Comput Sci, vol. 84, 
no. 2, pp. 199–223, 1991. 

[58] 

A. Weimerskirch and C. Paar, “Generalizations of the Karatsuba algorithm for efficient 
implementations,” Cryptology ePrint Archive, 2006. 

[59] 

J. Renegar, “Linear programming, complexity theory and elementary functional analysis,” 
Mathematical Programming, vol. 70, no. 1, pp. 279–351, 1995. 

[60] 

M. Agrawal, N. Kayal, and N. Saxena, “PRIMES is in P,” 2004. 

[61] 

M. R. Garey and D. S. Johnson, “Computers and intractability,” A Guide to the, 1979. 

[62] 

S. A. Cook, “The complexity of theorem-proving procedures,” in Proceedings of the third 
annual ACM symposium on Theory of computing, 1971, pp. 151–158. 

[63] 

H. Kellerer, U. Pferschy, and D. Pisinger, “Introduction to NP-Completeness of knapsack 
problems,” in Knapsack problems, Springer, 2004, pp. 483–493. 

[64] 

M. R. Garey and D. S. Johnson, “The complexity of near-optimal graph coloring,” Journal of 
the ACM (JACM), vol. 23, no. 1, pp. 43–49, 1976. 

[65] 

A. Itai, C. H. Papadimitriou, and J. L. Szwarcfiter, “Hamilton paths in grid graphs,” SIAM 
Journal on Computing, vol. 11, no. 4, pp. 676–686, 1982. 

[66] 

C. Lecoutre, Constraint Networks: Targeting Simplicity for Techniques and Algorithms. John 
Wiley & Sons, 2013. 

[67] 

A. A. Bulatov, “A dichotomy theorem for nonuniform CSPs,” in 2017 IEEE 58th Annual 
Symposium on Foundations of Computer Science (FOCS), 2017, pp. 319–330. 

[68] 

K. Claessen, N. Een, M. Sheeran, and N. Sorensson, “SAT-solving in practice,” in 2008 9th 
International Workshop on Discrete Event Systems, 2008, pp. 61–67. 

[69] 

J. H. Liang, V. Ganesh, E. Zulkoski, A. Zaman, and K. Czarnecki, “Understanding VSIDS 
branching heuristics in conflict-driven clause-learning SAT solvers,” in Haifa Verification 
Conference, 2015, pp. 225–241. 

[70] 

O. Ohrimenko, P. J. Stuckey, and M. Codish, “Propagation via lazy clause generation,” 
Constraints, vol. 14, no. 3, pp. 357–391, 2009. 

[71] 

T. Feydy and P. J. Stuckey, “Lazy clause generation reengineered,” in International 
Conference on Principles and Practice of Constraint Programming, 2009, pp. 352–366. 

[72] 

Stuckey P, “Search is Dead Long Live Proof,” 2013.