Caricamento...
Gibbs states and the set of solutions of random constraint satisfaction problems
An instance of a random constraint satisfaction problem defines a random subset (the set of solutions) of a large product space X(N) (the set of assignments). We consider two prototypical problem ensembles (random k-satisfiability and q-coloring of random regular graphs) and study the uniform meas...
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
National Academy of Sciences
2007
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC1965511/ https://ncbi.nlm.nih.gov/pubmed/17567754 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1073/pnas.0703685104 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|