Bookcover of Models of Query Complexity for Boolean Functions
Booktitle:

Models of Query Complexity for Boolean Functions

LAP LAMBERT Academic Publishing (2010-08-06 )

Books loader

Omni badge eligible for voucher
ISBN-13:

978-3-8383-9269-1

ISBN-10:
3838392698
EAN:
9783838392691
Book language:
English
Blurb/Shorttext:
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).
Publishing house:
LAP LAMBERT Academic Publishing
Website:
https://www.lap-publishing.com/
By (author) :
Sourav Chakraborty
Number of pages:
132
Published at:
2010-08-06
Stock:
Available
Category:
Mathematics
Price:
59.00 €
Keywords:
Query Complexity, Property Testing

Books loader

Newsletter

Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::unionpay Paypal Wire Transfer

  0 products in the shopping cart
Edit cart
Loading frontend
LOADING