Sciweavers

77 search results - page 5 / 16
» Boolean Circuits and a DNA Algorithm in Membrane Computing
Sort
View
FOCS
1989
IEEE
13 years 11 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
VLSID
2007
IEEE
153views VLSI» more  VLSID 2007»
14 years 8 months ago
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
Zhaohui Fu, Sharad Malik
STOC
1996
ACM
97views Algorithms» more  STOC 1996»
13 years 11 months ago
Deterministic Restrictions in Circuit Complexity
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
Shiva Chaudhuri, Jaikumar Radhakrishnan
ACSD
2005
IEEE
71views Hardware» more  ACSD 2005»
14 years 1 months ago
Maximal Causality Analysis
Perfectly synchronous systems immediately react to the inputs of their environment, which may lead to so-called causality cycles between actions and their trigger conditions. Algo...
Klaus Schneider, Jens Brandt, Tobias Schüle, ...
TCAD
2008
102views more  TCAD 2008»
13 years 7 months ago
Quantum Circuit Simplification and Level Compaction
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller...