MARC 主機 00000nam a2200445K 4500
001 AAI22588517
005 20200824072439.5
006 m o d
007 cr mn ---uuuuu
008 200824s2019 miu sbm 000 0 eng d
020 9781392428795
035 (MiAaPQ)AAI22588517
040 MiAaPQ|beng|cMiAaPQ|dNTU
100 1 Liu, Jingcheng
245 10 Approximate Counting, Phase Transitions and Geometry of
Polynomials
264 0 |c2019
300 1 online resource (117 pages)
336 text|btxt|2rdacontent
337 computer|bc|2rdamedia
338 online resource|bcr|2rdacarrier
500 Source: Dissertations Abstracts International, Volume: 81-
06, Section: B
500 Advisor: Sinclair, Alistair
502 Thesis (Ph.D.)--University of California, Berkeley, 2019
504 Includes bibliographical references
520 In classical statistical physics, a phase transition is
understood by studying the geometry (the zero-set) of an
associated polynomial (the partition function). In this
thesis, we will show that one can exploit this notion of
phase transitions algorithmically, and conversely exploit
the analysis of algorithms to understand phase
transitions. As applications, we give efficient
deterministic approximation algorithms (FPTAS) for
counting $q$-colorings, and for computing the partition
function of the Ising model
533 Electronic reproduction.|bAnn Arbor, Mich. :|cProQuest,
|d2020
538 Mode of access: World Wide Web
650 4 Computer science
653 approximate counting
653 geometry of polynomials
653 graph coloring
653 Ising model
653 partition function
653 phase transitions
655 7 Electronic books.|2local
690 0984
710 2 ProQuest Information and Learning Co
710 2 University of California, Berkeley.|bElectrical
Engineering & Computer Sciences
773 0 |tDissertations Abstracts International|g81-06B
856 40 |uhttps://pqdd.sinica.edu.tw/twdaoapp/servlet/
advanced?query=22588517|zclick for full text (PQDT)
912 PQDT
