Publicado por TeubnerToronto 1987, 1987
Librería: Antiquariat Thomas & Reinhard, Recklinghausen, NRW, Alemania
EUR 13,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoKARTONIERT, 457 Seiten, dies sind regulär ausgesondertes Bibliotheksexemplar aus einer wissenschaftlichen Bibliothek mit der üblichen Signatur und Stempel, keine Markierungen/Anmerkungen, das Buch ist in einem tadellosen Zustand --- HARDCOVER, Lib. Ex., 457 pages, no marks, excellent condition. Shipping to abroad insured with tracking number.
Librería: Ammareal, Morangis, Francia
EUR 42,58
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Bon. Ancien livre de bibliothèque avec équipements. Couverture différente. Edition 1991. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Different cover. Edition 1991. Ammareal gives back up to 15% of this item's net price to charity organizations.
EUR 30,55
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Near Fine. A clean, bright and crisp hardback copy without a dust jacket-as issued. No previous ownership names. There is a tiny bit of creasing at the head and tail of the spine, but overall this is a very fresh and attractive copy.
EUR 16,95
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTeubner, ., 1987, , 457, Hardcover (gebunden), 8°, ohne Schutzumschlag, Englisch, Einband: leicht bestoßen, leicht fleckig, Seiten: minimal gebräunt.
EUR 46,64
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Library sticker on front cover. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:9780471915553.
Publicado por LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Idioma: Inglés
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 59,00
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: 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.
Publicado por LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Idioma: Inglés
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 123,41
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Publicado por John Wiley and Sons Ltd, 1991
ISBN 10: 0471915556 ISBN 13: 9780471915553
Idioma: Inglés
Librería: OM Books, Sevilla, SE, España
EUR 599,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoCondición: Usado - bueno.
Publicado por LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 48,50
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondició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.
Publicado por LAP LAMBERT Academic Publishing Aug 2010, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Idioma: Inglés
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 59,00
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. 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.
Publicado por LAP LAMBERT Academic Publishing, 2010
ISBN 10: 3838392698 ISBN 13: 9783838392691
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 59,00
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. 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).