519 search results - page 46 / 104 » A New Approach to Strongly Polynomial Linear Programming |
106
click to vote
ML
2006
ACM
15 years 7 months ago
2006
ACM
We present a new way to generate type-error messages in a polymorphic, implicitly, and strongly typed language (specifically Caml). Our method separates error-message generation ...
116
click to vote
LATIN
2010
Springer
14 years 12 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
146
click to vote
ECCC
2011
14 years 8 months ago
2011
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
117
click to vote
CAV
2003
Springer
15 years 6 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
113
click to vote
MP
2006
15 years 1 months ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...