Quantified Derandomization Image close
Quantified Derandomization by Roei Tell
Quantified Derandomization by Roei Tell
Show Hide Adult Content
Quantified Derandomization close

Computers & Internet Books:

Home  
Books  
Computers & Internet  
Computer science

Quantified Derandomization

How to Find Water in the Ocean
Click to share your rating 0 ratings (0.0/5.0 average) Thanks for your vote!

By:

Format:

Paperback / softback
$203.99
Available from supplier

The item is brand new and in-stock with one of our preferred suppliers. The item will ship from a Mighty Ape warehouse within the timeframe shown.

Usually ships in 3-4 weeks
0 in Trolley

Buy Now, Pay Later with:

4 payments of $51.00 with Afterpay Learn more

Availability

Delivering to:

Estimated arrival:

  • Around 28 Jun - 10 Jul using International Courier

Explore more Foundations and Trends(R) in Theoretical Computer Science

See all products in this series

On Doubly-Efficient Interactive Proof Systems by Oded Goldreich
$160.99
On Doubly-Efficient Interactive Proof Systems
by Oded Goldreich ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Algorithms and Data Structures for External Memory by Jeffrey Scott Vitter
$209.99
Algorithms and Data Structures for External Memory
by Jeffrey Scott Vitter ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Communication Complexity (for Algorithm Designers) by Tim Roughgarden
$209.99
Communication Complexity (for Algorithm Designers)
by Tim Roughgarden ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Higher-order Fourier Analysis and Applications by Hamed Hatami
$209.99
Higher-order Fourier Analysis and Applications
by Hamed Hatami ~ Paperback / softback
Available - Usually ships in 3-4 weeks
A Survey of Lower Bounds for Satisfiability and Related Problems by Dieter Melkebeek
$170.99
A Survey of Lower Bounds for Satisfiability and Related Problems
by Dieter Melkebeek ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Complexity Lower Bounds using Linear Algebra by Satya Lokam
$209.99
Complexity Lower Bounds using Linear Algebra
by Satya Lokam ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Bayesian Mechanism Design by Jason D. Hartline
$191.99
Bayesian Mechanism Design
by Jason D. Hartline ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Data Streams by S. Muthukrishnan
$129.99
Data Streams
by S. Muthukrishnan ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Multi-Valued Reasoning about Reactive Systems by Orna Kupferman
$172.99
Multi-Valued Reasoning about Reactive Systems
by Orna Kupferman ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Probabilistic Proof Systems by Oded Goldreich
$160.99
Probabilistic Proof Systems
by Oded Goldreich ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Faster Algorithms via Approximation Theory by Sushant Sachdeva
$160.99
Faster Algorithms via Approximation Theory
by Sushant Sachdeva ~ Paperback / softback
Available - Usually ships in 3-4 weeks
A Decade of Lattice Cryptography by Chris Peikert
$209.99
A Decade of Lattice Cryptography
by Chris Peikert ~ Paperback / softback
Available - Usually ships in 3-4 weeks
On the Power of Small-Depth Computation by Emanuele Viola
$140.99
On the Power of Small-Depth Computation
by Emanuele Viola ~ Paperback / softback
Available - Usually ships in 3-4 weeks
The Design of Competitive Online Algorithms via a Primal-Dual Approach by Niv Buchbinder
$209.99
The Design of Competitive Online Algorithms via a Primal-Dual Approach
by Niv Buchbinder ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Spectral Algorithms by Ravindran Kannan
$209.99
Spectral Algorithms
by Ravindran Kannan ~ Paperback / softback
Available - Usually ships in 3-4 weeks
Approximate Degree in Classical and Quantum Computing by Mark Bun
$211.99
Approximate Degree in Classical and Quantum Computing
by Mark Bun ~ Paperback / softback
Available - Usually ships in 3-4 weeks

Description

The focus of this monograph is the question of quantified derandomization. Does derandomization of probabilistic algorithms become easier if we only want to derandomize algorithms that err with extremely small probability? How small does this probability need to be in order for the problem’s complexity to be affected? In this comprehensive survey of the topic, the author describes the body of knowledge accumulated since the question was first raised in 2014, focusing on the following directions: 1) Hardness vs “quantified” randomness; 2) Improving on the brute-force algorithm for quantified derandomization implies breakthrough circuit lower bounds; 3) Unconditional algorithms for quantified derandomization of low-depth circuits and formulas; 4) Arithmetic quantified derandomization; 5) Limitations of certain black-box techniques and pseudoentropy. Written for researchers, this monograph provides the readers with a concise overview of all known results, but the author also shows several results that are either new or are strengthenings of others. The author also offers a host of concrete challenges and open questions surrounding quantified derandomization.
Release date Australia
October 12th, 2022
Author
Pages
140
Audience
  • Professional & Vocational
ISBN-13
9781638280927
Product ID
36042562

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here

Recommended for you

Recommended from your browsing history

Help & options

Filed under...

Books >
Computers & Internet >
Computer science