13603 search results - page 168 / 2721 » On the Computational Complexity of Cut-Reduction |
210
click to vote
FOCS
1991
IEEE
15 years 10 months ago
1991
IEEE
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
173
click to vote
AIPS
2004
15 years 8 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
143
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
138
click to vote
NA
2006
15 years 6 months ago
2006
Abstract. The present article summarizes the state of the art algorithms to compute the discrete Moreau envelope, and presents a new linear-time algorithm, named NEP for NonExpansi...
152
click to vote
CG
2004
Springer
15 years 6 months ago
2004
Springer
In recent years point-based geometry has gained increasing attention as an alternative surface representation, both for efficient rendering and for flexible geometry processing of...