352 search results - page 28 / 71 » Proofs as Polynomials |
94
Voted
CIE
2010
Springer
15 years 3 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
120
Voted
STOC
2010
ACM
15 years 2 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
73
Voted
COCO
2009
Springer
15 years 4 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
96
Voted
FQ
2003
Springer
15 years 3 months ago
2003
Springer
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...
81
Voted
ACMSE
2006
ACM
15 years 2 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...