Sciweavers

1795 search results - page 42 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ICCAD
1996
IEEE
93views Hardware» more  ICCAD 1996»
14 years 25 days ago
VERILAT: verification using logic augmentation and transformations
This paper presents a new framework for formal logic verification. What is depicted here is fundamentally different from previous approaches. In earlier approaches, the circuit is ...
Dhiraj K. Pradhan, Debjyoti Paul, Mitrajit Chatter...
AHS
2006
IEEE
104views Hardware» more  AHS 2006»
13 years 10 months ago
Evolutionary Design of Digital Circuits: Where Are Current Limits?
The objective of this paper is to classify the approaches proposed to the evolutionary digital circuit design in the recent years and to identify the levels of complexity and inno...
Lukás Sekanina
DAGSTUHL
2006
13 years 10 months ago
Graphs and Circuits: Some Further Remarks
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
Stasys Jukna
ASPDAC
2007
ACM
81views Hardware» more  ASPDAC 2007»
14 years 20 days ago
Fault Dictionary Size Reduction for Million-Gate Large Circuits
- In general, fault dictionary is prevented from practical applications for its extremely large size. Several previous works are proposed for the fault dictionary size reduction. H...
Yu-Ru Hong, Juinn-Dar Huang
CCL
1994
Springer
14 years 24 days ago
Application of Constraint Logic Programming for VLSI CAD Tools
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
Renate Beckmann, Ulrich Bieker, Ingolf Markhof