10988 search results - page 356 / 2198 » Algorithmic Folding Complexity |
129
click to vote
SWAT
1994
Springer
15 years 9 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
138
click to vote
JCT
2000
15 years 4 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
172
click to vote
PROPERTYTESTING
2010
15 years 2 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...
146
click to vote
ACMICEC
2003
ACM
15 years 10 months ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
146
click to vote
EUROCRYPT
2000
Springer
15 years 8 months ago
2000
Springer
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...