2477 search results - page 107 / 496 » Approximate extended formulations |
131
click to vote
JSYML
2006
15 years 4 months ago
2006
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko's theorem states that a formula is provabl...
114
click to vote
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
In this paper, we present a general algebraic framework for analysing decentralized control systems. We consider systems defined by linear fractional functions over a commutative ...
138
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
129
Voted
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
110
click to vote
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We investigate the decidability of observational equivalence and approximation in “Syntactic Control of Interference” (SCI). By asg denotations of terms in an inequationally fu...