Articles liés à Models of Query Complexity for Boolean Functions
Synopsis
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).
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
À propos de l?auteur
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.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurLAP Lambert Academic Publishing
- Date d'édition2010
- ISBN 10 3838392698
- ISBN 13 9783838392691
- ReliureBroché
- Langueanglais
- Nombre de pages132
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 48,50
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisRésultats de recherche pour Models of Query Complexity for Boolean Functions
Image fournie par le vendeur
Models of Query Complexity for Boolean Functions
Edité par
LAP LAMBERT Academic Publishing, 2010
ISBN 10 : 3838392698
ISBN 13 : 9783838392691
Neuf
Couverture souple
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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 réf. du vendeur 5419500
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Models of Query Complexity for Boolean Functions
Edité par
LAP LAMBERT Academic Publishing, 2010
ISBN 10 : 3838392698
ISBN 13 : 9783838392691
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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 réf. du vendeur 9783838392691
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Models of Query Complexity for Boolean Functions
Edité par
LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10 : 3838392698
ISBN 13 : 9783838392691
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : 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 réf. du vendeur 9783838392691
Quantité disponible : 2 disponible(s)
Image fournie par le vendeur
Models of Query Complexity for Boolean Functions
Edité par
LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10 : 3838392698
ISBN 13 : 9783838392691
Neuf
Taschenbuch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. 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).Books on Demand GmbH, Überseering 33, 22297 Hamburg 132 pp. Englisch. N° de réf. du vendeur 9783838392691
Quantité disponible : 2 disponible(s)
Image d'archives
Models of Query Complexity for Boolean Functions
Edité par
LAP LAMBERT Academic Publishing, 2010
ISBN 10 : 3838392698
ISBN 13 : 9783838392691
Ancien ou d'occasion
Paperback
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
Évaluation du vendeur 4 sur 5 étoiles
Paperback. Etat : Like New. Like New. book. N° de réf. du vendeur ERICA79038383926986
Quantité disponible : 1 disponible(s)