182 search results - page 34 / 37 » The Proof Complexity of Polynomial Identities |
COLT
2010
Springer
13 years 8 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
APPROX
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
ECCC
2010
13 years 8 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
BIRTHDAY
2010
Springer
13 years 11 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...