9 search results - page 2 / 2 » dimacs 2001 |
DIMACS
2001
13 years 11 months ago
2001
Let C be a smooth real plane curve. Let c be its degree and g its genus. We assume that C has at least g real branches. Let d be a nonzero natural integer strictly less than c. Let...
DIMACS
1996
13 years 11 months ago
1996
There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...
DIMACS
1996
13 years 11 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
ICCAD
2001
IEEE
14 years 6 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...