24132 search results - page 4536 / 4827 » and 2009 |
218
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
159
Voted
COCO
2009
Springer
16 years 1 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...
184
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
229
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
171
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...