Sciweavers

1795 search results - page 46 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
ISMVL
2003
IEEE
111views Hardware» more  ISMVL 2003»
14 years 1 months ago
Modeling Multi-Valued Circuits in SystemC
The complexity of todays hardware systems steadily increases. Due to this fact new ways of efficiently describing systems are investigated. A very promising approach in this area...
Daniel Große, Görschwin Fey, Rolf Drech...
LATIN
2004
Springer
14 years 2 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
ISVLSI
2007
IEEE
107views VLSI» more  ISVLSI 2007»
14 years 3 months ago
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusiveor Sum Of Products) expressions for any arbitrary incomplet...
Marinos Sampson, Dimitrios Voudouris, George K. Pa...
CDES
2008
130views Hardware» more  CDES 2008»
13 years 10 months ago
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Multi-Output Incompletely Specified Boolean Functions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-outp...
Marinos Sampson, Dimitrios Voudouris, George K. Pa...
VLSID
1999
IEEE
91views VLSI» more  VLSID 1999»
14 years 29 days ago
Timed Circuit Synthesis Using Implicit Methods
The design and synthesis of asynchronous circuits is gaining importance in both the industrial and academic worlds. Timed circuits are a class of asynchronous circuits that incorp...
Robert Thacker, Wendy Belluomini, Chris J. Myers