Please use this identifier to cite or link to this item: http://hdl.handle.net/2445/139831
Full metadata record
DC FieldValueLanguage
dc.contributor.authorMézard, Marc-
dc.contributor.authorPalassini, Matteo-
dc.contributor.authorRivoire, Olivier-
dc.date.accessioned2019-09-12T12:56:30Z-
dc.date.available2019-09-12T12:56:30Z-
dc.date.issued2005-11-10-
dc.identifier.issn0031-9007-
dc.identifier.urihttp://hdl.handle.net/2445/139831-
dc.description.abstractWe 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.extent4 p.-
dc.format.mimetypeapplication/pdf-
dc.language.isoeng-
dc.publisherAmerican Physical Society-
dc.relation.isformatofReproducció del document publicat a: https://doi.org/10.1103/PhysRevLett.95.200202-
dc.relation.ispartofPhysical Review Letters, 2005, vol. 95, num. 20, p. 200202-
dc.relation.urihttps://doi.org/10.1103/PhysRevLett.95.200202-
dc.rights(c) American Physical Society, 2005-
dc.subject.classificationGeometria de l'espai-
dc.subject.classificationAlgorismes-
dc.subject.otherSolid geometry-
dc.subject.otherAlgorithms-
dc.titleLandscape of Solutions in Constraint Satisfaction Problems-
dc.typeinfo:eu-repo/semantics/article-
dc.typeinfo:eu-repo/semantics/publishedVersion-
dc.identifier.idgrec568959-
dc.date.updated2019-09-12T12:56:30Z-
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess-
Appears in Collections:Articles publicats en revistes (Física de la Matèria Condensada)

Files in This Item:
File Description SizeFormat 
568959.pdf217.28 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.