Randomness Computation (46 results)

Hardcover. Condition: Fair. 1. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Hardcover. Condition: very good. Very Good Copy. Customer Service Guaranteed.

Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Condition: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

hardcover. Condition: Very Good. 1st Edition. Used - Very Good.

Hardcover. Condition: Near Fine. Hardcover in excellent, unmarked condition: slight handling, slight lower corner bump. 387 pages, with equations throughout. [1.6 lbs] 384 p. Book.

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

hardcover. Condition: New. In shrink wrap. Looks like an interesting title.

paperback. Condition: Very Good.

Condition: New.

Condition: New. In.

Condition: New.

Condition: New. pp. 382.

Condition: New. pp. XI + 563.

Paperback. Condition: Brand New. 461 pages. 9.26x6.11x9.21 inches. In Stock.

hardcover. Condition: Gut. 440 Seiten; 9789814327749.3 Gewicht in Gramm: 500.

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

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains a collection of studies in the areas of complexity theory and local algorithms. A common theme in most of the papers is the interplay between randomness and computation. This interplay is pivotal to some parts of complexity theory and is essential for local algorithms.The works included address a variety of topics in the areas of complexity theory and local algorithms. Within complexity theory the topics include approximation algorithms, counting problems, enumeration problems, explicit construction of expander graphs, fine grained complexity, interactive proof systems, PPT-search and pseudodeterminism, space complexity, and worst-case to average-case reductions. Within local algorithms the focus is mostly on property testing and on locally testable and decodable codes. In particular, many of the works seek to advance the study of testing graph properties in the bounded-degree graph model. Other topics in property testing include testing group properties and testing properties of affine subspaces.…

Taschenbuch. Condition: 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. Condition: 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. Condition: Brand New. 574 pages. 9.21x6.38x1.18 inches. In Stock.

Taschenbuch. Condition: Neu. Studies in Complexity and Cryptography | Miscellanea on the Interplay between Randomness and Computation | Oded Goldreich | Taschenbuch | xii | Englisch | 2011 | Springer | EAN 9783642226694 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. …

Condition: New.

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book presents a collection of 36 pieces of scientific work in the areas of complexity theory and foundations of cryptography: 20 research contributions, 13 survey articles, and 3 programmatic and reflective viewpoint statements. These so far formally unpublished pieces were written by Oded Goldreich, some in collaboration with other scientists. The articles included in this book essentially reflect the topical scope of the scientific career of Oded Goldreich now spanning three decades. In particular the topics dealt with include average-case complexity, complexity of approximation, derandomization, expander graphs, hashing functions, locally testable codes, machines that take advice, NP-completeness, one-way functions, probabilistically checkable proofs, proofs of knowledge, property testing, pseudorandomness, randomness extractors, sampling, trapdoor permutations, zero-knowledge, and non-iterative zero-knowledge.All in all, this potpourri of studies in complexity and cryptography constitutes a most valuable contribution to the field of theoretical computer science centered around the personal achievements and view of one of its outstanding representatives.…

Condition: As New. Unread book in perfect condition.

Condition: New.

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Condition: New.