µn¤J
¡U
µù¥U
¡U
·|û¤¤¤ß
¡U
µ²±b
¡U
°ö°V½Òµ{
Å]ªk§Ì¤l
¡U
¦Û¸ê¥Xª©
¡U
¹q¤l®Ñ
¡U
«ÈªA¤¤¤ß
¡U
´¼¼z«¬¥ßÊ^·|û
®Ñ¦W
¥Xª©ªÀ
§@ªÌ
isbn
½s¸¹
5050Å]ªk²³Äw
|
NG®Ñ«°
|
°ê»Ú¯Å«~µP½Òµ{
|
Àu´f³qª¾
|
ÅRÆE^¶¯µ¼Öºë¿ï
|
^¤åEmail¡A§AÀ³¸Ó§Û³o¤@¥»¡I¡G(¶WÈ¥úºÐªþÃØ¥þ®Ñ±`¥Î±¡¹Ò^¤åEmail½d¥»¡Aª½±µ½Æ»s¶K¤W¦n²³æ¡I)
¦¹§@ªÌµL¬ÛÃö®ÑÄy
¤å¾Ç¤p»¡
¤å¾Ç
¡U
¤p»¡
°ÓºÞ³Ð§ë
°]¸g§ë¸ê
¡U
¦æ¾P¥øºÞ
¤H¤åÃÀ§{
©v±Ð¡Bõ¾Ç
ªÀ·|¡B¤H¤å¡B¥v¦a
ÃÀ³N¡B¬ü¾Ç
¡U
¹q¼vÀ¸¼@
Ày§Ó¾i¥Í
ÂåÀø¡B«O°·
®Æ²z¡B¥Í¬¡¦Ê¬ì
±Ð¨|¡B¤ß²z¡BÀy§Ó
¶i׾Dzß
¹q¸£»Pºô¸ô
¡U
»y¨¥¤u¨ã
Âø»x¡B´Á¥Z
¡U
x¬F¡Bªk«ß
°Ñ¦Ò¡B¦Ò¸Õ¡B±Ð¬ì¥Î®Ñ
¬ì¾Ç¤uµ{
¬ì¾Ç¡B¦ÛµM
¡U
¤u·~¡B¤uµ{
®a®x¿Ë¤l
®a®x¡B¿Ë¤l¡B¤H»Ú
«C¤Ö¦~¡Bµ£®Ñ
ª±¼Ö¤Ñ¦a
®È¹C¡B¦a¹Ï
¡U
¥ð¶¢®T¼Ö
º©µe¡B´¡¹Ï
¡U
¨î¯Å
COMPUTATIONAL COMPLEXITY¡G A MODERN APPROACH
§@ªÌ¡G
ARORA
¤ÀÃþ¡G
»y¨¥¤u¨ã
¡þ
^»y¶i×
ÂO®Ñ¨t¦C¡G¹ê¥Î¸ê°T
¥Xª©ªÀ¡G
¥þµØ¹Ï®Ñ
¥Xª©¤é´Á¡G2009/1/1
ISBN¡G0521424267
®ÑÄy½s¸¹¡Gkk0248921
¶¼Æ¡G608
©w»ù¡G
1200
¤¸
®Ñ»ùY¦³²§°Ê¡A¥H¥Xª©ªÀ¹ê»Ú©w»ù¬°·Ç
qÁÊ«á¥ß§Y¬°±z¶i³f
qÁÊ«á¥ß§Y¬°±z¶i³f¡G¥Ø«eµL®w¦s¶q,ŪªÌ¤Uq«á,¶}©l¶i¤J½Õ®Ñµ{§Ç,¤@¯ë¤Ñ¼Æ¬ù¬°2-10¤u§@¤é(¤£§t¨Ò°²¤é)¡C
¹ÎÁʼƳ̧C¬° 20 ¥»¥H¤W
µû»ù¼Æ¡G
(½Ð±N·Æ¹«²¾¦Ü¬P¬P³B¶i¦æµû»ù)
¥Ø«e¥§¡µû»ù¡G
¤å¦r³sµ²
½Æ»s»yªk
COMPUTATIONAL COMPLEXITY¡G A MODERN APPROACH
¹Ï¤ù³sµ²
½Æ»s»yªk
¤À
¨É
¤º®e²¤¶
¦PÃþ±ÀÂË
COMPUTATIONAL COMPLEXITY¡G A MODERN APPROACH This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. Requiring essentially no background apart from mathematical maturity, the book can be used as a reference for self-study for anyone interested in complexity, including physicists, mathematicians, and other scientists, as well as a textbook for a variety of courses and seminars. More than 300 exercises are included with a selected hint set. The book starts with a broad introduction to the field and progresses to advanced results. Contents include: definition of Turing machines and basic time and space complexity classes, probabilistic algorithms, interactive proofs, cryptography, quantum computation, lower bounds for concrete computational models (decision trees, communication complexity, constant depth, algebraic and monotone circuits, proof complexity), average-case complexity and hardness amplification, derandomization and pseudorandom constructions, and the PCP theorem.
ÃöÁä^³æ 2¡G108
¥´³y¦¨¥\²ßºDªº^»y§Û
GEPT·s¨î¥þ¥Á^ÀË
GEPT ·s¨î¥þ¥Á^
FUN¾Ç¬ü°ê¦U¾Ç¬ìªì
FUN¾Ç¬ü°ê¦U¾Ç¬ìªì
³o¼Ë¾Ç¥~»y¤~¦³®Ä¡G¥~
µJÂI^»y¾\Ū 1¡G¤»
±q^¤å¤åªk¥y«¬¨ìµu¤å
¯d¾Ç¡A¬O¬°¤F¦¨¬°§ó¦n
¬°¤F«O»Ù±zªºÅv¯q¡A·sµ·¸ôºô¸ô®Ñ©±©ÒÁʶRªº°Ó«~§¡¨É¦³¨ì³f¤C¤ÑªºÅ²½à´Á¡]§t¨Ò°²¤é¡^¡C°h¦^¤§°Ó«~¥²¶·©óŲ½à´Á¤º±H¦^¡]¥H¶lÂW©Î¦¬°õÁp¬°¾Ì¡^¡A¥B°Ó«~¥²¶·¬O¥þ·sª¬ºA»P§¹¾ã¥]¸Ë(°Ó«~¡Bªþ¥ó¡B¤º¥~¥]¸Ë¡BÀH³f¤å¥ó¡BÃØ«~µ¥)¡A§_«h®¤¤£±µ¨ü°h³f¡C