國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Computational complexity and propert...

Goldreich, Oded.

Computational complexity and property testingon the interplay between randomness and computation /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Computational complexity and property testingedited by Oded Goldreich.
其他題名:	on the interplay between randomness and computation /
其他作者:	Goldreich, Oded.
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	x, 382 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computational complexity.
電子資源:	https://doi.org/10.1007/978-3-030-43662-9
ISBN:	9783030436629$q(electronic bk.)

Computational complexity and property testingon the interplay between randomness and computation /
Computational complexity and property testingon the interplay between randomness and computation /[electronic resource] :edited by Oded Goldreich. - Cham :Springer International Publishing :2020. - x, 382 p. :ill., digital ;24 cm. - Lecture notes in computer science,120500302-9743 ;. - Lecture notes in computer science ;4891..

A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy -- Bridging a Small Gap in the Gap Ampli cation of Assignment Testers -- On (Valiant's) Polynomial-Size Monotone Formula for Majority -- Two Comments on Targeted Canonical Derandomizers -- On the Effect of the Proximity Parameter on Property Testers -- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions -- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing -- Super-Perfect Zero-Knowledge Proofs -- On the Relation between the Relative Earth Mover Distance and the Variation Distance (an exposition) -- The Uniform Distribution is Complete with respect to Testing Identity to a Fixed Distribution -- A Note on Tolerant Testing with One-Sided Error -- On Emulating Interactive Proofs with Public Coins -- Reducing Testing Affine Spaces to Testing Linearity of Functions -- Deconstructing 1-Local Expanders -- Worst-case to Average-case Reductions for Subclasses of P -- On the Optimal Analysis of the Collision Probability Tester (an exposition) -- On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions -- Constant-Round Interactive Proof Systems for AC0[2] and NC1 -- Flexible Models for Testing Graph Properties -- Pseudo-Mixing Time of Random Walks -- On Constructing Expanders for any Number of Vertices.

This volume contains a collection of studies in the areas of complexity theory and property testing. The 21 pieces of scientific work included were conducted at different times, mostly during the last decade. Although most of these works have been cited in the literature, none of them was formally published before. Within complexity theory the topics include constant-depth Boolean circuits, explicit construction of expander graphs, interactive proof systems, monotone formulae for majority, probabilistically checkable proofs (PCPs), pseudorandomness, worst-case to average-case reductions, and zero-knowledge proofs. Within property testing the topics include distribution testing, linearity testing, lower bounds on the query complexity (of property testing), testing graph properties, and tolerant testing. A common theme in this collection is the interplay between randomness and computation.

ISBN: 9783030436629$q(electronic bk.)

Standard No.: 10.1007/978-3-030-43662-9doiSubjects--Topical Terms:

185313
Computational complexity.

LC Class. No.: QA267.7 / .C65 2020

Dewey Class. No.: 511.352

Computational complexity and property testingon the interplay between randomness and computation /
LDR:03469nmm a2200361 a 4500 001 572467
003 DE-He213
005 20200403161441.0
006 m d
007 cr nn 008maaau
008 200925s2020 sz s 0 eng d
020 $a 9783030436629$q(electronic bk.)
020 $a 9783030436612$q(paper)
024 7 $a 10.1007/978-3-030-43662-9 $2 doi
035 $a 978-3-030-43662-9
040 $a GP $c GP
041 0 $a eng
050 4 $a QA267.7 $b .C65 2020
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 511.352 $2 23
090 $a QA267.7 $b .C738 2020
245 0 0 $a Computational complexity and property testing $h [electronic resource] : $b on the interplay between randomness and computation / $c edited by Oded Goldreich.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a x, 382 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12050
490 1 $a Theoretical computer science and general issues
505 0 $a A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy -- Bridging a Small Gap in the Gap Ampli cation of Assignment Testers -- On (Valiant's) Polynomial-Size Monotone Formula for Majority -- Two Comments on Targeted Canonical Derandomizers -- On the Effect of the Proximity Parameter on Property Testers -- On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions -- On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing -- Super-Perfect Zero-Knowledge Proofs -- On the Relation between the Relative Earth Mover Distance and the Variation Distance (an exposition) -- The Uniform Distribution is Complete with respect to Testing Identity to a Fixed Distribution -- A Note on Tolerant Testing with One-Sided Error -- On Emulating Interactive Proofs with Public Coins -- Reducing Testing Affine Spaces to Testing Linearity of Functions -- Deconstructing 1-Local Expanders -- Worst-case to Average-case Reductions for Subclasses of P -- On the Optimal Analysis of the Collision Probability Tester (an exposition) -- On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions -- Constant-Round Interactive Proof Systems for AC0[2] and NC1 -- Flexible Models for Testing Graph Properties -- Pseudo-Mixing Time of Random Walks -- On Constructing Expanders for any Number of Vertices.
520 $a This volume contains a collection of studies in the areas of complexity theory and property testing. The 21 pieces of scientific work included were conducted at different times, mostly during the last decade. Although most of these works have been cited in the literature, none of them was formally published before. Within complexity theory the topics include constant-depth Boolean circuits, explicit construction of expander graphs, interactive proof systems, monotone formulae for majority, probabilistically checkable proofs (PCPs), pseudorandomness, worst-case to average-case reductions, and zero-knowledge proofs. Within property testing the topics include distribution testing, linearity testing, lower bounds on the query complexity (of property testing), testing graph properties, and tolerant testing. A common theme in this collection is the interplay between randomness and computation.
650 0 $a Computational complexity. $3 185313
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Computer Systems Organization and Communication Networks. $3 273709
650 2 4 $a Probability and Statistics in Computer Science. $3 274053
650 2 4 $a Logic in AI. $3 836108
650 2 4 $a Information Systems Applications (incl. Internet) $3 530743
650 2 4 $a Data Structures. $3 273992
700 1 $a Goldreich, Oded. $3 279127
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-43662-9
950 $a Computer Science (Springer-11645)