{"product_id":"models-of-query-complexity-for-boolean-functions-von-sourav-chakraborty","title":"Models of Query Complexity for Boolean Functions","description":"\u003cp\u003eIn 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).\u003c\/p\u003e\u003cdiv class=\"aw-variant-hidden-subtitle-div\" id=\"aw-variant-subtitle-9783838392691\"\u003e\u003ch3\u003e\u003c\/h3\u003e\u003c\/div\u003e","brand":"Autorenwelt Shop","offers":[{"title":"Softcover - 9783838392691","offer_id":39498901454941,"sku":"9783838392691","price":59.0,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0940\/0622\/files\/2006f934-3041-4ff4-93d4-7ddb14f26e20.jpg?v=1770790459","url":"https:\/\/shop.autorenwelt.de\/en\/products\/models-of-query-complexity-for-boolean-functions-von-sourav-chakraborty","provider":"Autorenwelt Shop","version":"1.0","type":"link"}