388 search results - page 34 / 78 » Quantum Lower Bounds by Polynomials |
JC
2007
13 years 7 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
COLT
2004
Springer
14 years 24 days ago
2004
Springer
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
JCSS
2008
13 years 7 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
AAAI
2008
13 years 9 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...