๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A lower bound for randomized algebraic decision trees

โœ Scribed by Dima Grigoriev; Marek Karpinski; Friedhelm Meyer auf der Heide; Roman Smolensky

Publisher
Springer
Year
1996
Tongue
English
Weight
974 KB
Volume
6
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Lower bounds for algebraic decision tree
Lower bounds for algebraic decision trees
โœ J Michael Steele; Andrew C Yao ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 445 KB
Entropy lower bounds for quantum decisio
Entropy lower bounds for quantum decision tree complexity
โœ Yaoyun Shi ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 70 KB

We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard decision tree computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round consisting of O(log n) bits. Let E(f ) be the Shanno

Complexity Lower Bounds for Approximatio
Complexity Lower Bounds for Approximation Algebraic Computation Trees
โœ Felipe Cucker; Dima Grigoriev ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB

We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such functions.