568 search results - page 14 / 114 » New bounds for the Cebysev functional |
COCO
2009
Springer
14 years 2 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
COCO
2005
Springer
14 years 1 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
ISMVL
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper proposes a method to represent elementary functions such as trigonometric, logarithmic, square root, and reciprocal functions using edge-valued multi-valued decision di...
ML
2007
ACM
13 years 7 months ago
2007
ACM
We prove new lower bounds for learning intersections of halfspaces, one of the most important concept classes in computational learning theory. Our main result is that any statist...
PVLDB
2008
13 years 7 months ago
2008
The dependency propagation problem is to determine, given a view defined on data sources and a set of dependencies on the sources, whether another dependency is guaranteed to hold...