971 search results - page 2 / 195 » Approximate Satisfiability and Equivalence |
DATE
1999
IEEE
13 years 9 months ago
1999
IEEE
The problem of checking the equivalence of combinational circuits is of key significance in the verification of digital circuits. In recent years, several approaches have been pro...
ICCD
1991
IEEE
13 years 8 months ago
1991
IEEE
JSAT
2006
13 years 5 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
DISOPT
2006
13 years 5 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...