467 search results - page 13 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
COCO
2001
Springer
14 years 1 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
STOC
2004
ACM
14 years 8 months ago
2004
ACM
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
GLOBECOM
2007
IEEE
13 years 10 months ago
2007
IEEE
- How to prolong the lifetime of wireless sensor networks is one of the most important design issues. In order to tackle this issue, we propose an energy-efficient polynomial regre...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...