10608 search results - page 282 / 2122 » Complexity of O'Hara's Algorithm |
101
click to vote
JCT
2000
15 years 11 days 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 ...
124
click to vote
PROPERTYTESTING
2010
14 years 10 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...
109
click to vote
ACMICEC
2003
ACM
15 years 5 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...
109
click to vote
EUROCRYPT
2000
Springer
15 years 4 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...
104
click to vote
FCS
2006
15 years 2 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...