Models of Query Complexity for Boolean Functions - Sourav Chakraborty
-40% koodiga BOOKS
Saadetis 12-18 tööpäeva jooksul
30-päevane tagastamisõigus
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 ... Täielik kirjeldus
Võib-olla meeldib sulle ka
TOP
Determined: The Science of Life Without Free Will
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-40% koodiga BOOKS
Meie tarnija laos
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-40% koodiga BOOKS
Laos
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-40% koodiga BOOKS
Meie tarnija laos
TOP
Biology: A Global Approach, Global Edition
Neil Campbell, Rebecca Orr, Lisa Urry, Peter Minorsky, Michael Cain, Jane Reece, Steven Wasserman
-40% koodiga BOOKS
Meie tarnija laos
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Secrets of our DNA: How Genetics has Changed the World
-40% koodiga BOOKS
Meie tarnija laos
TOP
Janeway's Immunobiology
Leslie J. Berg, Kenneth Murphy, Casey Weaver
-40% koodiga BOOKS
Meie tarnija laos
TOP
How to Solve it: A New Aspect of Mathematical Method
-40% koodiga BOOKS
Meie tarnija laos
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
-40% koodiga BOOKS
Meie tarnija laos
TOP
Why Machines Learn: The Elegant Maths Behind Modern AI
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Feynman Lectures on Physics. The New Millennium Edition
Matthew Sands, Robert Leighton, Richard Feynman
-40% koodiga BOOKS
Meie tarnija laos
TOP
Entangled Life: How Fungi Make Our Worlds, Change Our Minds and Shape Our Futures
-40% koodiga BOOKS
Meie tarnija laos
TOP
Life As No One Knows It: The Physics of Life's Emergence
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-40% koodiga BOOKS
Meie tarnija laos
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-40% koodiga BOOKS
Meie tarnija laos
TOP
The Road to Reality: A Complete Guide to the Laws of the Universe
-40% koodiga BOOKS
Meie tarnija laos
Kirjeldus
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).
Lisateave
| Autor | Sourav Chakraborty |
|---|---|
| Kirjastaja | LAP LAMBERT Academic Publishing |
| Väljalaskeaasta | 2010 |
| Kaanetüüp | Pehme kaanega |
| EAN | 9783838392691 |