2957 search results - page 16 / 592 » The Complexity of Polynomial-Time Approximation |
JCT
2000
13 years 7 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 ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
BIRTHDAY
2010
Springer
13 years 8 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
CSR
2009
Springer
14 years 2 months ago
2009
Springer
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σp 2 . In the case of linear matroids, which are represented over poly...
STOC
1999
ACM
13 years 12 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...