3221 search results - page 185 / 645 » Termination of Linear Programs |
182
click to vote
ORL
2008
15 years 6 months ago
2008
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
196
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda-calculus for the QRAM model, following the work of P. Seling...
170
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 ...
271
click to vote
ERSHOV
2009
Springer
16 years 28 days ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
159
click to vote
FSTTCS
2004
Springer
15 years 11 months ago
2004
Springer
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the...