Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation: 12050 (Lecture Notes in Computer Science, 12050) - Image 1

£64.57

Springer Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation: 12050 (Lecture Notes in Computer Science, 12050)

Name: Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation: 12050 (Lecture Notes in Computer Science, 12050)
Brand: Springer
Price: 64.57 GBP
Availability: InStock

AI & Machine Learning

This is the most expensive it has ever been. Walk away.

£65 today · previous high £65 · all-time low £65

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 70 days · 70 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 70 days • 1 price levels

Days at Price

Price Analysis

Most common price: £65 (70 days, 100.0%)

Price range: £65 - £65

Price levels: 1 different prices over 70 days

Description

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.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3030436616
Category: Books > Subjects > Computing & Internet > Computer Science > AI & Machine Learning
Domain: Amazon UK
Release Date: 04 April 2020
Listed Since: 16 February 2020

Barcode

No barcode data available

Springer Computational Complexity and Property Testing: On the Interplay Between Randomness and Computation: 12050 (Lecture Notes in Computer Science, 12050)

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Mathematical Foundations of Computer Science 2000: 25th International Symposium, MFCS 2000 Bratislava, Slovakia, August 28 - September 1, 2000 ... (Lecture Notes in Computer Science, 1893)

Bounded Arithmetic, Propositional Logic and Complexity Theory: 60 (Encyclopedia of Mathematics and its Applications, Series Number 60)

Forcing with Random Variables and Proof Complexity: 382 (London Mathematical Society Lecture Note Series, Series Number 382)

Kolmogorov Complexity and Computational Complexity (Monographs in Theoretical Computer Science. An EATCS Series)

Complexity in Information Theory

Cambridge Logical Foundations of Proof Complexity Book

Random Generation of Trees: Random Generators in Computer Science

Modern Cryptography, Probabilistic Proofs and Pseudorandomness: 17 (Algorithms and Combinatorics, 17)

Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings: 9472 (Lecture Notes in Computer Science, 9472)

Complexity Classifications of Boolean Constraint Satisfaction Problems (Monographs on Discrete Mathematics and Applications): 7 (Monographs on Discrete Mathematics and Applications, Series Number 7)

Random Trees: An Interplay between Combinatorics and Probability

Leveraging Applications of Formal Methods, Verification and Validation. Rigorous Engineering of Collective Adaptive Systems: 12th International ... (Lecture Notes in Computer Science, 15220)

State-Space Search: Algorithms, Complexity, Extensions, and Applications

Complexity: Knots, Colourings and Countings: 186 (London Mathematical Society Lecture Note Series, Series Number 186)

Randomized Algorithms: Approximation, Generation, and Counting (Distinguished Dissertations)

Interactive Theorem Proving: 9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, ... (Lecture Notes in Computer Science, 10895)

Computing and Combinatorics: 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings: 12273 (Lecture Notes in Computer Science, 12273)

An Introduction to Formal Languages and Machine Computation

Simplicity is Complex: Foundations of Cyber-Physical System Design

The Foundations of Computability Theory

Computable Analysis: An Introduction (Texts in Theoretical Computer Science. An EATCS Series)

Open Problems in Mathematics and Computational Science

Principles and Practice of Constraint Programming: 25th International Conference, CP 2019, Stamford, CT, USA, September 30 – October 4, 2019, ... (Lecture Notes in Computer Science, 11802)

The Testability of Distributed Real-Time Systems: 245 (The Springer International Series in Engineering and Computer Science, 245)