2767 search results - page 79 / 554 » Universal Exponentiation Algorithm |
122
click to vote
COCO
2007
Springer
15 years 7 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
141
Voted
SIGIR
2004
ACM
15 years 7 months ago
2004
ACM
The exponential growth of data demands scalable infrastructures capable of indexing and searching rich content such as text, music, and images. A promising direction is to combine...
108
click to vote
ECCC
2007
15 years 1 months ago
2007
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
113
click to vote
JC
2007
15 years 1 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
121
click to vote
Lecture Notes
in Algorithmic Game Theory, Noam Nisan, Tim Roughgarden, Eva Tardos and Vijay Vazirani (eds.), Chapter 16, Cambrige University Press, 2007