Editors:
- State of the art research in Computational Complexity and Property Testing
- Unique visibility
- Contributions by well-known experts in the field
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 12050)
Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (21 chapters)
-
Front Matter
About this book
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.
Keywords
- artificial intelligence
- computer networks
- computer security
- computer systems
- Computer-Aided Design (CAD)
- cryptography
- engineering
- formal logic
- formal proofs
- formal verifications
- graph theory
- internet
- mathematics
- network protocols
- network security
- probability
- signal processing
- software engineering
- theoretical computer science
- verification
Editors and Affiliations
-
Weizmann Institute of Science, Rehovot, Israel
Oded Goldreich
Bibliographic Information
Book Title: Computational Complexity and Property Testing
Book Subtitle: On the Interplay Between Randomness and Computation
Editors: Oded Goldreich
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-43662-9
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2020
Softcover ISBN: 978-3-030-43661-2Published: 04 April 2020
eBook ISBN: 978-3-030-43662-9Published: 03 April 2020
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 382
Topics: Theory of Computation, Computer Systems Organization and Communication Networks, Probability and Statistics in Computer Science, Logic in AI, Information Systems Applications (incl. Internet), Data Structures