107 search results - page 11 / 22 » Fixed-Polynomial Size Circuit Bounds |
KBSE
2007
IEEE
14 years 1 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
ISPD
2000
ACM
14 years 1 days ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...
DATE
2005
IEEE
14 years 1 months ago
2005
IEEE
- The problem of determining lower bounds for the energy cost of a given nanoscale design is addressed via a complexity theory-based approach. This paper provides a theoretical fra...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like low-pow...
SYNASC
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...