Sciweavers

1795 search results - page 26 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
DATE
2002
IEEE
108views Hardware» more  DATE 2002»
14 years 14 days ago
A Case Study for the Verification of Complex Timed Circuits: IPCMOS
ions + Assume Guarantee + Induction GOAL: Formal verification of the IPCMOS architecture
Marco A. Peña, Jordi Cortadella, Alexander ...
GLVLSI
1996
IEEE
128views VLSI» more  GLVLSI 1996»
13 years 11 months ago
Delay Hazards in Complex Gate Based Speed Independent VLSI Circuits
Nozar Tabrizi, Michael J. Liebelt, Kamran Eshraghi...
FOCS
1992
IEEE
13 years 11 months ago
Separating the Communication Complexities of MOD m and MOD p Circuits
: We prove in this paper that it is much harder to evaluate depth
Vince Grolmusz