東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Computational complexity theory /

Rudich, Steven.

FindBook

Google Book

Amazon

博客來

Computational complexity theory /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Computational complexity theory // Steven Rudich, Avi Wigderson, editors.
其他作者:	Rudich, Steven.
出版者:	Providence, R.I. :American Mathematical Society; : c2004.,
面頁冊數:	1 online resource (xiv, 389 p. : ill.)
附註:	"Volume contains the lecture notes from the Graduate Summer School program on Computational Complexity Theory held in Princeton in the summer of 2000"--T.p. verso.
標題:	Computational complexity. -
電子資源:	http://www.ams.org/pcms/010
電子資源:	https://doi.org/10.1090/pcms/010
ISBN:	9781470439095 (online)

Computational complexity theory /
Computational complexity theory /[electronic resource] Steven Rudich, Avi Wigderson, editors. - Providence, R.I. :American Mathematical Society;c2004. - 1 online resource (xiv, 389 p. : ill.) - IAS/Park City Mathematics Series, v. 102472-5064 ; .

"Volume contains the lecture notes from the Graduate Summer School program on Computational Complexity Theory held in Princeton in the summer of 2000"--T.p. verso.

Includes bibliographical references.

Introduction

Access is restricted to licensed institutions

Electronic reproduction.
Providence, Rhode Island :
American Mathematical Society.
2012

Mode of access : World Wide Web

ISBN: 9781470439095 (online)Subjects--Topical Terms:

523870
Computational complexity.

LC Class. No.: QA267.7 / .C685 2004

Dewey Class. No.: 511.3/52

Computational complexity theory /
LDR:01688pmm 22003014a 4500 001 2405079
003 RPAM
005 20170613150600.0
006 aa b 000 0
007 cr/|||||||||||
008 251219s2004 nyua ob 000 0 eng
020 $a 9781470439095 (online)
035 $a 13588429
040 $a DLC $c DLC $d YDX $d UKM $d DLC $d RPAM
050 0 0 $a QA267.7 $b .C685 2004
082 0 0 $a 511.3/52 $2 22
245 0 0 $a Computational complexity theory / $h [electronic resource] $c Steven Rudich, Avi Wigderson, editors.
260 $a Providence, R.I. : $b American Mathematical Society; $a [Princeton, N.J.] : $b Institute for Advanced Study, $c c2004.
300 $a 1 online resource (xiv, 389 p. : ill.)
490 0 $a IAS/Park City Mathematics Series, $x 2472-5064 ; $v v. 10
500 $a "Volume contains the lecture notes from the Graduate Summer School program on Computational Complexity Theory held in Princeton in the summer of 2000"--T.p. verso.
504 $a Includes bibliographical references.
505 0 0 $t Introduction $t Complexity theory: From G{uml}odel to Feynman $t Average case complexity $t Exploring complexity through reductions $t Quantum computation $t Circuit and Communication Complexity $t Proof complexity $t Preface to "Week Three: Randomness in Computation" $t Pseudorandomness -- Part I $t Pseudorandomness -- Part II $t Probabilistic proof systems -- Part I $t Probabilistically checkable proofs
506 1 $a Access is restricted to licensed institutions
533 $a Electronic reproduction. $b Providence, Rhode Island : $c American Mathematical Society. $d 2012
538 $a Mode of access : World Wide Web
588 $a Description based on print version record.
650 0 $a Computational complexity. $3 523870
700 1 $a Rudich, Steven. $3 1084002
700 1 $a Wigderson, Avi. $3 1084003
776 $6 903951 $t Computational complexity theory /
856 4 $3 Contents $u http://www.ams.org/pcms/010
856 4 $3 Contents $u https://doi.org/10.1090/pcms/010