1092 search results - page 66 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
144
click to vote
IPPS
2009
IEEE
16 years 16 days ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
122
click to vote
ISAAC
2009
Springer
16 years 13 days ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
131
click to vote
COCO
1998
Springer
15 years 10 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
165
click to vote
ESA
2006
Springer
15 years 9 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
144
click to vote
CAGD
2006
15 years 6 months ago
2006
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...