Sciweavers

2636 search results - page 75 / 528
» Linear Programming
Sort
View
POPL
2009
ACM
15 years 10 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux
CAV
2008
Springer
170views Hardware» more  CAV 2008»
14 years 12 months ago
Efficient Craig Interpolation for Linear Diophantine (Dis)Equations and Linear Modular Equations
Abstract. The use of Craig interpolants has enabled the development of powerful hardware and software model checking techniques. Efficient algorithms are known for computing interp...
Himanshu Jain, Edmund M. Clarke, Orna Grumberg
EOR
2011
106views more  EOR 2011»
14 years 1 months ago
Probability of unique integer solution to a system of linear equations
We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer:...
O. L. Mangasarian, Benjamin Recht
OL
2010
87views more  OL 2010»
14 years 8 months ago
Uniqueness of integer solution of linear equations
Abstract. We consider the system of m linear equations in n integer variables Ax = d and give sufficient conditions for the uniqueness of its integer solution x ∈ {−1,1}n by r...
O. L. Mangasarian, Michael C. Ferris
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
13 years 9 days ago
Separating multilinear branching programs and formulas
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir ...