Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/2445/139831
dc.contributor | Universitat de Barcelona |
---|---|
dc.contributor.author | Mézard, Marc |
dc.contributor.author | Palassini, Matteo |
dc.contributor.author | Rivoire, Olivier |
dc.date | 2019-09-12T12:56:30Z |
dc.date | 2019-09-12T12:56:30Z |
dc.date | 2005-11-10 |
dc.date | 2019-09-12T12:56:30Z |
dc.identifier.citation | 0031-9007 |
dc.identifier.citation | 568959 |
dc.identifier.uri | http://hdl.handle.net/2445/139831 |
dc.description.abstract | We present a theoretical framework for characterizing the geometrical properties of the space of solutions in constraint satisfaction problems, together with practical algorithms for studying this structure on particular instances. We apply our method to the coloring problem, for which we obtain the total number of solutions and analyze in detail the distribution of distances between solutions. |
dc.format | 4 p. |
dc.format | application/pdf |
dc.language.iso | eng |
dc.publisher | American Physical Society |
dc.relation | Reproducció del document publicat a: https://doi.org/10.1103/PhysRevLett.95.200202 |
dc.relation | Physical Review Letters, 2005, vol. 95, num. 20, p. 200202 |
dc.relation | https://doi.org/10.1103/PhysRevLett.95.200202 |
dc.rights | (c) American Physical Society, 2005 |
dc.rights | info:eu-repo/semantics/openAccess |
dc.subject | Geometria de l'espai |
dc.subject | Algorismes |
dc.subject | Solid geometry |
dc.subject | Algorithms |
dc.title | Landscape of Solutions in Constraint Satisfaction Problems |
dc.type | info:eu-repo/semantics/article |
dc.type | info:eu-repo/semantics/publishedVersion |