Items related to 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).
"synopsis" may belong to another edition of this title.
About the Author
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.
"About this title" may belong to another edition of this title.
- PublisherLAP LAMBERT Academic Publishing
- Publication date2010
- ISBN 10 3838392698
- ISBN 13 9783838392691
- BindingPaperback
- LanguageEnglish
- Number of pages132
Buy New
View this item
US$ 69.78
US$ 26.41 shipping from Germany to U.S.A.
Destination, rates & speedsSearch results for Models of Query Complexity for Boolean Functions
Seller Image
Models of Query Complexity for Boolean Functions
Published by
LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783838392691
Quantity: 2 available
Seller Image
Models of Query Complexity for Boolean Functions
Published by
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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). Seller Inventory # 9783838392691
Quantity: 1 available
Seller Image
Models of Query Complexity for Boolean Functions
Published by
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 5419500
Quantity: Over 20 available
Seller Image
Models of Query Complexity for Boolean Functions
Published by
LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783838392691
Quantity: 2 available
Stock Image
Models of Query Complexity for Boolean Functions
Published by
LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698
ISBN 13: 9783838392691
Used
Paperback
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Like New. Like New. book. Seller Inventory # ERICA79038383926986
Quantity: 1 available