Sciweavers

1795 search results - page 41 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
DAC
2010
ACM
14 years 18 days ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler
GECCO
2000
Springer
182views Optimization» more  GECCO 2000»
14 years 8 days ago
A Novel Evolvable Hardware Framework for the Evolution of High Performance Digital Circuits
This paper presents a novel evolvable hardware framework for the automated design of digital circuits for high performance applications. The technique evolves circuits correspondi...
Ben I. Hounsell, Tughrul Arslan
ICSE
2007
IEEE-ACM
14 years 8 months ago
Sequential Circuits for Relational Analysis
The Alloy tool-set has been gaining popularity as an alternative to traditional manual testing and checking for design correctness. Alloy uses a first-order relational logic for m...
Fadi A. Zaraket, Adnan Aziz, Sarfraz Khurshid
GLVLSI
2005
IEEE
97views VLSI» more  GLVLSI 2005»
14 years 2 months ago
On equivalence checking and logic synthesis of circuits with a common specification
In this paper we develop a theory of equivalence checking (EC) and logic synthesis of circuits with a common specification (CS). We show that two combinational circuits N1, N2 have...
Eugene Goldberg
ICALP
1995
Springer
14 years 7 days ago
New Collapse Consequences of NP Having Small Circuits
We show that if a self-reducible set has polynomial-size circuits, then it is low for the probabilistic class ZPP(NP). As a consequence we get a deeper collapse of the polynomial-...
Johannes Köbler, Osamu Watanabe