Von dem Buch Computational Complexity and Property Testing haben wir 2 gleiche oder sehr ähnliche Ausgaben identifiziert!
Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
100%: Oded Goldreich; Itai Benjamini; Scott Decatur; Maya Leshkowitz; Or Meir; Dana Ron; Guy Rothblum; Avishay Tal; Liav Teichner; Roei Tell; Avi Wigderson: Computational Complexity and Property Testing (ISBN: 9783030436629) Springer Shop, in Englisch, auch als eBook.Nur diese Ausgabe anzeigen…
100%: Oded Goldreich; Itai Benjamini; Scott Decatur; Maya Leshkowitz; Or Meir; Dana Ron; Guy Rothblum; Avishay Tal; Liav Teichner; Roei Tell; Avi Wigderson: Computational Complexity and Property Testing (ISBN: 9783030436612) Springer Shop, in Englisch, Taschenbuch.Nur diese Ausgabe anzeigen…
Computational Complexity and Property Testing - 2 Angebote vergleichen
Bester Preis: Fr. 2.70 (€ 2.77)¹ (vom 01.03.2020)1
Oded Goldreich; Itai Benjamini; Scott Decatur; Maya Leshkowitz; Or Meir; Dana Ron; Guy Rothblum; Avishay Tal; Liav Teichner; Roei Tell; Avi Wigderson
Computational Complexity and Property Testing
~EN PB NWISBN: 9783030436612 bzw. 3030436616, vermutlich in Englisch, Springer Shop, Taschenbuch, neu.
Lieferung aus: Vereinigtes Königreich Grossbritannien und Nordirland, Lagernd, zzgl. Versandkosten.
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. Soft cover.
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. Soft cover.
2
Oded Goldreich; Itai Benjamini; Scott Decatur; Maya Leshkowitz; Or Meir; Dana Ron; Guy Rothblum; Avishay Tal; Liav Teichner; Roei Tell; Avi Wigderson
Computational Complexity and Property Testing
~EN NW EB DLISBN: 9783030436629 bzw. 3030436624, vermutlich in Englisch, Springer Shop, neu, E-Book, elektronischer Download.
Lieferung aus: Vereinigtes Königreich Grossbritannien und Nordirland, Lagernd, zzgl. Versandkosten.
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. eBook.
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. eBook.
Lade…