1469 search results - page 289 / 294 » Approximate polynomial decomposition |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
ECCC
2010
14 years 9 months ago
2010
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In probabilistic grammatical inference, a usual goal is to infer a good approximation of an unknown distribution P called a stochastic language. The estimate of P stands in some cl...
CPHYSICS
2006
14 years 9 months ago
2006
The WATERWAVES program suite performs complex scattering calculations by propagating a wave packet in a complex, full-dimensional potential for non-rotating (J = 0) but vibrating ...
CC
2007
Springer
14 years 9 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...