Verlag: LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Sprache: Englisch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
EUR 59,00
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbTaschenbuch. Zustand: 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.
Verlag: LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Sprache: Englisch
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 122,86
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. Like New. book.
Verlag: LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Sprache: Englisch
Anbieter: moluna, Greven, Deutschland
EUR 48,50
Währung umrechnenAnzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: 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.
Verlag: LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Sprache: Englisch
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
EUR 59,00
Währung umrechnenAnzahl: 1 verfügbar
In den WarenkorbTaschenbuch. Zustand: 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).
Verlag: LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Sprache: Englisch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
EUR 59,00
Währung umrechnenAnzahl: 2 verfügbar
In den WarenkorbTaschenbuch. Zustand: 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.