How Many Colors to Color a Random Graph? Cavity, Complexity, Stability and All That

• Material Type: 記事
• Title: How Many Colors to Color a Random Graph? Cavity, Complexity, Stability and All That
• Title Transcription: How Many Colors to Color a Random Graph? Cavity, Complexity, Stability and All That
• Author/Editor: KRZAKALA,Florent
• Publication, Distribution, etc.: 日本 : Progress of Theoretical Physics
• Publication Date: 2005-04-30
• Publication Date (W3CDTF): 2005-04-30
• Periodical title: Progress of theoretical physics. Supplement
• No. or year of volume/issue: (157)
• Volume: (157)
• Pages: 357-360
• Text Language Code: ENG
• Note (General): 著者所属: Dipartimento di Fisica, INFM and SMC, Universita di Roma "La Sapienza"
• Persistent ID (NDL): info:ndljp/pid/10885878; https://dl.ndl.go.jp/pid/10885878
• Collection: 障害者向け資料
• Collection (Materials For Handicapped People:1): テキストデータ
• Collection (particular): 国立国会図書館デジタルコレクション > 電子書籍・電子雑誌 > 学術機関 > 学協会; https://dl.ndl.go.jp/collections/B00043
• Acquisition Basis: NII-ELS
• Available (W3CDTF): 2017-08-30
• Date Accepted (W3CDTF): 2017-08-22
• Date Captured (W3CDTF): 2017-08-22
• Format (IMT): application/pdf
• Access Restrictions: インターネット公開
• Availability of remote photoduplication service: 不可
• Periodical Title (Persistent ID (NDL)): info:ndljp/pid/10399204; https://dl.ndl.go.jp/pid/10399204
• Data Provider (Database): 国立国会図書館 : 国立国会図書館デジタルコレクション; https://dl.ndl.go.jp

• Summary, etc.: We review recent progress on the statiscal physics study of the problem of coloring random graphs with q colors. We discuss the existence of a thresho...