Computational complexity and statistical physics / editors, Allon G. Percus, Gabriel Istrate, Cristopher Moore.

Contributor(s):

Material type: Text

TextSeries: Proceedings volume in the Santa Fe Institute studies in the sciences of complexityPublication details: Oxford ; New York : Oxford University Press, 2006.Description: 1 online resource (xiii, 367 pages) : illustrationsContent type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

9780199760565
019976056X
1283097850
9781283097857

Subject(s): Genre/Form:

Additional physical formats: Print version:: Computational complexity and statistical physics.DDC classification:

511.3/52 22

LOC classification:

QA267.7 .C683 2006eb

Online resources:

Click here to access online

Contents:

Where statistical physics meets computation / Allon G. Percus, Gabriel Istrate, and Cristopher Moore -- Threshold phenomena and influence : perspectives from mathematics, computer science, and economics / Gil Kalai and Shmuel Safra -- Analyzing search algorithms with physical methods / Simona Cocco [and others] -- Constraint satisfaction by survey propagation / Alfredo Braunstein [and others] -- The easiest hard problem : number partitioning / Stephan Mertens -- Ground states, energy landscape, and low-temperature dynamics of ±J spin glasses / Sigismund Kobe and Jarek Krawczyk -- The satisfiability threshold conjecture : techniques behind upper bound improvements / Lefteris M. Kirousis, Yannis C. Stamatiou, and Michele Zito -- Proving conditional randomness using the principle of deferred decisions / Alexis C. Kaporis, Lefteris M. Kirousis, and Yiannis C. Stamatiou -- The phase transition in the random hornSAT problem / Demetrios D. Demopoulos and Moshe Y. Vardi -- Phase transitions for quantum search algorithms / Tad Hogg -- Scalability, random surfaces, and synchronized computing networks / Zoltan Toroczkai [and others] -- Combinatorics of genotype-phenotype maps : an RNA case study / Christian M. Reidys -- Towards a predictive computational complexity theory for periodically specified problems : a survey / Harry B. Hunt III [and others].

Summary: Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied techniques from the study of phase transitions to analyze NP-complete problems such as satisfiability and graph coloring. This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them. Computational Complexity and Statistical Physics will serve as.

Item type:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Collection	Call number	Materials specified	Status	Date due	Barcode
Electronic-Books	OPJGU Sonepat- Campus	E-Books EBSCO			Available

Includes bibliographical references (pages 319-351) and index.

Print version record.

Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied techniques from the study of phase transitions to analyze NP-complete problems such as satisfiability and graph coloring. This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them. Computational Complexity and Statistical Physics will serve as.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide

There are no comments on this title.

to post a comment.