computational complexity property testing (11 résultats)

paperback. Etat : Very Good.

Etat : New. pp. 382.

Taschenbuch. Etat : Neu. Computational Complexity and Property Testing | On the Interplay Between Randomness and Computation | Oded Goldreich | Taschenbuch | Lecture Notes in Computer Science | x | Englisch | 2020 | Springer | EAN 9783030436612 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.

Paperback. Etat : New. New. book.

Etat : new. Questo è un articolo print on demand.

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 392 pp. Englisch.

Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. State of the art research in&nbspComputational Complexity and Property TestingUnique visibilityContributions by well-known experts in the fieldThis volume contains a collection of studies in the areas of co.

Etat : New. Print on Demand pp. 382.

Etat : New. PRINT ON DEMAND pp. 382.

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 392 pp. Englisch.