8824 search results - page 209 / 1765 » On the Complexity of Real Functions |
170
click to vote
ACMICEC
2003
ACM
15 years 11 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...
176
click to vote
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
We present a constant-round non-malleable commitment scheme based on the existence of sub-exponential one-way functions and using a blackbox proof of security. As far as we know, t...
205
click to vote
ECCC
2010
15 years 5 months ago
2010
We study the problem of testing isomorphism (equivalence up to relabelling of the variables) of two Boolean functions f, g : {0, 1}n → {0, 1}. Our main focus is on the most stud...
132
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: It has been previously shown that palindromic sequences are frequently observed in proteins. However, our knowledge about their evolutionary origin and their possible ...
171
click to vote
JCT
2000
15 years 6 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 ...