國立虎尾科技大學 |

Computational Complexity and Property Testing = On the Interplay Between Randomness and Computation /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Computational Complexity and Property Testing/ edited by Oded Goldreich.
其他題名:	On the Interplay Between Randomness and Computation /
其他作者:	Goldreich, Oded.
面頁冊數:	X, 382 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Data Structures. -
電子資源:	https://doi.org/10.1007/978-3-030-43662-9
ISBN:	9783030436629

Computational Complexity and Property Testing = On the Interplay Between Randomness and Computation /
Computational Complexity and Property TestingOn the Interplay Between Randomness and Computation /[electronic resource] :edited by Oded Goldreich. - 1st ed. 2020. - X, 382 p.online resource. - Theoretical Computer Science and General Issues ;12050. - Theoretical Computer Science and General Issues ;9163.

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

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

669824
Data Structures.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Computational Complexity and Property Testing = On the Interplay Between Randomness and Computation /
LDR:03764nam a22004335i 4500 001 1026743
003 DE-He213
005 20200704063004.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783030436629 $9 978-3-030-43662-9
024 7 $a 10.1007/978-3-030-43662-9 $2 doi
035 $a 978-3-030-43662-9
050 4 $a QA75.5-76.95
050 4 $a QA76.63
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 004.0151 $2 23
245 1 0 $a Computational Complexity and Property Testing $h [electronic resource] : $b On the Interplay Between Randomness and Computation / $c edited by Oded Goldreich.
250 $a 1st ed. 2020.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a X, 382 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Theoretical Computer Science and General Issues ; $v 12050
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 2 4 $a Data Structures. $3 669824
650 2 4 $a Information Systems Applications (incl. Internet). $3 881699
650 2 4 $a Logic in AI. $3 1228083
650 2 4 $a Probability and Statistics in Computer Science. $3 669886
650 2 4 $a Computer Systems Organization and Communication Networks. $3 669309
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Data structures (Computer science). $3 680370
650 0 $a Application software. $3 528147
650 0 $a Computer logic. $3 786340
650 0 $a Artificial intelligence. $3 559380
650 0 $a Mathematical statistics. $3 527941
650 0 $a Computer organization. $3 596298
650 0 $a Computers. $3 565115
700 1 $a Goldreich, Oded. $4 edt $4 http://id.loc.gov/vocabulary/relators/edt $3 786282
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030436612
776 0 8 $i Printed edition: $z 9783030436636
830 0 $a Theoretical Computer Science and General Issues ; $v 9163 $3 1253524
856 4 0 $u https://doi.org/10.1007/978-3-030-43662-9
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
912 $a ZDB-2-LNC
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)