Sinopsis
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).
"Sinopsis" puede pertenecer a otra edición de este libro.
Acerca del 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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Resultados de la búsqueda para Models of Query Complexity for Boolean Functions
Imagen del vendedor
Models of Query Complexity for Boolean Functions
Publicado por
LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
Nuevo
Taschenbuch
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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). 132 pp. Englisch. Nº de ref. del artículo: 9783838392691
Comprar nuevo
EUR 59,00
Envío por EUR 23,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 2 disponibles
Imagen del vendedor
Models of Query Complexity for Boolean Functions
Publicado por
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
Nuevo
Kartoniert / Broschiert
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Kartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Chakraborty SouravSourav 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.In this thesis we s. Nº de ref. del artículo: 5419500
Comprar nuevo
EUR 48,50
Envío por EUR 48,99
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Models of Query Complexity for Boolean Functions
Publicado por
LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
Nuevo
Taschenbuch
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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).VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 132 pp. Englisch. Nº de ref. del artículo: 9783838392691
Comprar nuevo
EUR 59,00
Envío por EUR 60,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Models of Query Complexity for Boolean Functions
Publicado por
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
Nuevo
Taschenbuch
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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). Nº de ref. del artículo: 9783838392691
Comprar nuevo
EUR 59,00
Envío por EUR 61,08
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 1 disponibles
Imagen del vendedor
Models of Query Complexity for Boolean Functions
Publicado por
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
Nuevo
Taschenbuch
Librería: preigu, Osnabrück, Alemania
Calificación del vendedor: 5 de 5 estrellas
Taschenbuch. Condición: Neu. Models of Query Complexity for Boolean Functions | Sourav Chakraborty | Taschenbuch | 132 S. | Englisch | 2010 | LAP LAMBERT Academic Publishing | EAN 9783838392691 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Nº de ref. del artículo: 107436188
Comprar nuevo
EUR 51,00
Envío por EUR 70,00
Se envía de Alemania a Estados Unidos de America
Se envía de Alemania a Estados Unidos de America
Cantidad disponible: 5 disponibles
Imagen de archivo
Models of Query Complexity for Boolean Functions
Publicado por
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
Antiguo o usado
Paperback
Librería: Mispah books, Redhill, SURRE, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book. Nº de ref. del artículo: ERICA79038383926986
Comprar usado
EUR 131,01
Envío por EUR 28,91
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 1 disponibles