Sciweavers

254 search results - page 31 / 51
» Linear Arithmetic with Stars
Sort
View
COCO
1997
Springer
144views Algorithms» more  COCO 1997»
13 years 11 months ago
Polynomial Vicinity Circuits and Nonlinear Lower Bounds
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
Kenneth W. Regan
COCO
2010
Springer
139views Algorithms» more  COCO 2010»
13 years 11 months ago
On Matrix Rigidity and Locally Self-Correctable Codes
We describe a new approach for the problem of finding rigid matrices, as posed by Valiant [Val77], by connecting it to the, seemingly unrelated, problem of proving lower bounds f...
Zeev Dvir
SODA
2003
ACM
122views Algorithms» more  SODA 2003»
13 years 9 months ago
Certifying and repairing solutions to large LPs how good are LP-solvers?
State-of-the-art linear programming (LP) solvers give solutions without any warranty. Solutions are not guaranteed to be optimal or even close to optimal. Of course, it is general...
Marcel Dhiflaoui, Stefan Funke, Carsten Kwappik, K...
JSAT
2006
108views more  JSAT 2006»
13 years 7 months ago
Translating Pseudo-Boolean Constraints into SAT
In this paper, we describe and evaluate three different techniques for translating pseudoboolean constraints (linear constraints over boolean variables) into clauses that can be h...
Niklas Eén, Niklas Sörensson
APLAS
2011
ACM
12 years 7 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...