467 search results - page 54 / 94 » The Complexity of Polynomials and Their Coefficient Function... |
155
click to vote
TSP
2010
15 years 26 days ago
2010
We consider the problem of approximating a regular function f(t) from its samples, f(nT), taken in a uniform grid. Quasi-interpolation schemes approximate f(t) with a dilated versi...
155
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Cai and Selman [CS99] defined a modification of Levin’s notion of average polynomial time and proved, for every P-bi-immune language L and every polynomial-time computable dis...
177
click to vote
CISC
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will re...
128
click to vote
TOG
2010
15 years 26 days ago
2010
This paper introduces a fully-Eulerian interface tracking framework that preserves the fine details of liquids. Unlike existing Eulerian methods, the proposed framework shows good...
278
click to vote
POPL
2006
ACM
16 years 6 months ago
2006
ACM
Abstract. This paper investigates what is essentially a call-by-value version of PCF under a complexity-theoretically motivated type system. The programming formalism, ATR, has its...