1795 search results - page 39 / 359 » On the Complexity of Circuit Satisfiability |
ACAL
2007
Springer
14 years 2 months ago
2007
Springer
There has been some ambiguity about the growth of attractors in Kauffman networks with network size. Some recent work has linked this to the role and growth of circuits or loops o...
ICCAD
1999
IEEE
14 years 29 days ago
1999
IEEE
Interconnect reduction is an important step in the design and analysis of complex interconnects found in present-day integrated circuits. This paper presents techniques for obtain...
ASPDAC
2008
ACM
13 years 10 months ago
2008
ACM
The impact of parameter variations in integrated analog circuits is usually analyzed by Monte Carlo methods with a high number of simulation runs. Few approaches based on interval ...
MST
2008
13 years 8 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...