388 search results - page 27 / 78 » Quantum Lower Bounds by Polynomials |
COCO
2005
Springer
14 years 28 days ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
RECOMB
2005
Springer
14 years 7 months ago
2005
Springer
Recombination is an important evolutionary mechanism responsible for the genetic diversity in humans and other organisms. Recently, there has been extensive research on understandi...
MST
2010
13 years 5 months ago
2010
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
JSC
2010
13 years 5 months ago
2010
We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of Rk , assuming that P is p...