Models of Query Complexity for Boolean Functions (Paperback)

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).

General

Imprint:	Lap Lambert Academic Publishing
Country of origin:	Germany
Release date:	August 2010
First published:	August 2010
Authors:	Sourav Chakraborty
Dimensions:	229 x 152 x 8mm (L x W x T)
Format:	Paperback - Trade
Pages:	132
ISBN-13:	978-3-8383-9269-1
Categories:	Books > Science & Mathematics > Mathematics > General
LSN:	3-8383-9269-8
Barcode:	9783838392691

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!