Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. Achlioptas, D., Ricci-Tersenghi, F.: On the solution-space geometry of random constraint satisfaction problems. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp 130–139. ACM (2006)
2. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with boolean blocks, part i: Posts lattice with applications to complexity theory. In: SIGACT News (2003)
3. Bonsma, P., Cereceda, L.: Finding paths between graph colourings: Pspace-completeness and superpolynomial distances. Theor. Comput. Sci. 410(50), 5215–5226 (2009)
4. Bulatov, A.A.: A dichotomy theorem for constraints on a three-element set. In: Proceedings of The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp 649–658. IEEE (2002)
5. Cereceda, L., Van den Heuvel, J., Johnson, M.: Finding paths between 3-colorings. J. Graph Theory 67(1), 69–82 (2011)