388 search results - page 16 / 78 » Quantum Lower Bounds by Polynomials |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
COCO
2008
Springer
13 years 8 months ago
2008
Springer
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...
ALT
2010
Springer
13 years 8 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability
COCO
2004
Springer
14 years 3 days ago
2004
Springer
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
FOCS
2002
IEEE
13 years 11 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....