Models of Query Complexity for Boolean Functions - Sourav Chakraborty
-30% with code BOOKS
Shipping in 12-18 days
30-day return policy
In this thesis we study various models of query complexity. A query algorithm computes a function under the restriction that the input can be accessed only by making probes to the the bits of the input. The query complexity of a function $f$ is the minimum number of probes made by any query algorithm that computes $f$. In this thesis, we consider three different models of query complexity, (1) deterministic ... Full description
You May Also Like
TOP
Determined: The Science of Life Without Free Will
-30% with code BOOKS
In stock at our supplier
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-30% with code BOOKS
In stock at our supplier
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-30% with code BOOKS
In stock
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-30% with code BOOKS
In stock at our supplier
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-30% with code BOOKS
In stock at our supplier
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-30% with code BOOKS
In stock at our supplier
TOP
Explaining AuDHD: The expert-led guide to Autism and ADHD Co-concurrence
-30% with code BOOKS
In stock at our supplier
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-30% with code BOOKS
In stock at our supplier
TOP
The Secrets of our DNA: How Genetics has Changed the World
-30% with code BOOKS
In stock at our supplier
TOP
How to Solve it: A New Aspect of Mathematical Method
-30% with code BOOKS
In stock at our supplier
TOP
Factfulness: Ten Reasons We're Wrong About the World--and Why Things Are Better Than You Think
Ola Rosling, Anna Rosling Rönnlund, Hans Rosling
-30% with code BOOKS
In stock at our supplier
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-30% with code BOOKS
In stock at our supplier
TOP
The Feynman Lectures on Physics. The New Millennium Edition
Matthew Sands, Robert Leighton, Richard Feynman
-30% with code BOOKS
In stock at our supplier
TOP
Seven Brief Lessons on Physics
-30% with code BOOKS
In stock at our supplier
TOP
Entangled Life: How Fungi Make Our Worlds, Change Our Minds and Shape Our Futures
-30% with code BOOKS
In stock at our supplier
TOP
Life As No One Knows It: The Physics of Life's Emergence
-30% with code BOOKS
In stock at our supplier
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-30% with code BOOKS
In stock at our supplier
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-30% with code BOOKS
In stock at our supplier
TOP
Janeway's Immunobiology
Leslie J. Berg, Kenneth Murphy, Casey Weaver
-30% with code BOOKS
In stock at our supplier
Description
In this thesis we study various models of query complexity. A query algorithm computes a function under the restriction that the input can be accessed only by making probes to the the bits of the input. The query complexity of a function $f$ is the minimum number of probes made by any query algorithm that computes $f$. In this thesis, we consider three different models of query complexity, (1) deterministic decision tree complexity (query complexity when the underlying algorithm is deterministic), (2) approximate decision tree complexity aka. property testing (query complexity when the underlying algorithm is probabilistic and only expected to "approximately" compute $f$) and quantum query complexity (query complexity when the underlying algorithm is allowed to make quantum queries).
More Information
| Author | Sourav Chakraborty |
|---|---|
| Publisher | LAP LAMBERT Academic Publishing |
| Release year | 2010 |
| Cover type | Softcover |
| EAN | 9783838392691 |