467 search results - page 44 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
90
Voted
STOC
2007
ACM
16 years 3 days ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
122
click to vote
TSP
2010
14 years 6 months ago
2010
We propose a novel equalization method for doubly selective wireless channels, whose taps are represented by an arbitrary Basis Expansion Model (BEM). We view such a channel in the...
FOCS
2007
IEEE
15 years 6 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
123
click to vote
COCO
2009
Springer
15 years 6 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...
117
click to vote
FSTTCS
1992
Springer
15 years 3 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...