Sciweavers

1795 search results - page 33 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ICCAD
2003
IEEE
154views Hardware» more  ICCAD 2003»
14 years 5 months ago
Length-Matching Routing for High-Speed Printed Circuit Boards
As the clock frequencies used in industrial applications increase, the timing requirements imposed on routing problems become tighter. So, it becomes important to route the nets w...
Muhammet Mustafa Ozdal, Martin D. F. Wong
COMPLEX
2009
Springer
14 years 3 months ago
Characterizing the Structural Complexity of Real-World Complex Networks
Although recent research has shown that the complexity of a network depends on its structural organization, which is linked to the functional constraints the network must satisfy, ...
Jun Wang, Gregory M. Provan
DAGSTUHL
2006
13 years 10 months ago
A note on the size of Craig Interpolants
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
Uwe Schöning, Jacobo Torán
AIML
2004
13 years 10 months ago
On the Complexity of Fragments of Modal Logics
We study and give a summary of the complexity of 15 basic normal monomodal logics under the restriction to the Horn fragment and/or bounded modal depth. As new results, we show tha...
Linh Anh Nguyen
ISLPED
1996
ACM
78views Hardware» more  ISLPED 1996»
14 years 24 days ago
Gate-level current waveform simulation of CMOS integrated circuits
We present a new gate-level approach to current simulation. We use a symbolic model of current pulses that takes accurately into account the dependence on the switching conditions...
Alessandro Bogliolo, Luca Benini, Giovanni De Mich...