complexity boolean functions (6 Ergebnisse)

KARTONIERT, 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.

Hardcover. Zustand: 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.

Zustand: 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.

Teubner, ., 1987, , 457, Hardcover (gebunden), 8°, ohne Schutzumschlag, Englisch, Einband: leicht bestoßen, leicht fleckig, Seiten: minimal gebräunt.

Taschenbuch. 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.

Taschenbuch. Zustand: 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: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbieter: preigu.