Models of Query Complexity for Boolean Functions - Softcover

Chakraborty, Sourav

 
9783838392691: Models of Query Complexity for Boolean Functions
Softcover
ISBN 10: 3838392698 ISBN 13: 9783838392691
Verlag: LAP Lambert Academic Publishing, 2010

Inhaltsangabe

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

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

Sourav Chakraborty received his Phd in Computer Science from The University of Chicago. He did his undergraduate studies in mathematics at the Chennai Mathematical Institute, Chennai, India.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
LAP Lambert Academic Publishing
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
3838392698
ISBN 13 
9783838392691
Einband
Tapa blanda
Anzahl der Seiten
132
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar