2693 search results - page 46 / 539 » On Computing Complex Navigation Functions |
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Maximum likelihood estimators are often of limited practical use due to the intensive computation they require. We propose a family of alternative estimators that maximize a stoch...
EUROCRYPT
2004
Springer
14 years 3 months ago
2004
Springer
We revisit the following open problem in information-theoretic cryptography: Does the communication complexity of unconditionally secure computation depend on the computational com...
FOCS
1991
IEEE
14 years 1 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...