1795 search results - page 39 / 359 » On the Complexity of Circuit Satisfiability |
145
click to vote
ACAL
2007
Springer
16 years 1 days 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...
129
click to vote
ICCAD
1999
IEEE
15 years 10 months 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...
152
click to vote
ASPDAC
2008
ACM
15 years 7 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 ...
154
click to vote
MST
2008
15 years 5 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...
151
click to vote
WADS
2007
Springer
15 years 12 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...