Sciweavers

707 search results - page 96 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
ISAAC
1995
Springer
135views Algorithms» more  ISAAC 1995»
13 years 11 months ago
The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation
Ordered Binary-Decision Diagrams (OBDD) are the state-of-the-art data structure for boolean function manipulation and there exist several software packages for OBDD manipulation. ...
Lars Arge
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 8 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
ALIFE
2006
13 years 8 months ago
Through the Interaction of Neutral and Adaptive Mutations, Evolutionary Search Finds a Way
An evolutionary system that supports the interaction of neutral and adaptive mutations is investigated. Experimental results on a Boolean function and needle-in-haystack problems s...
Tina Yu, Julian Francis Miller
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 8 months ago
Complementary Sets, Generalized Reed-Muller Codes, and Power Control for OFDM
The use of error-correcting codes for tight control of the peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency-division multiplexing (OFDM) transmission is considere...
Kai-Uwe Schmidt
DATE
1998
IEEE
100views Hardware» more  DATE 1998»
14 years 11 days ago
Combinational Verification based on High-Level Functional Specifications
We present a new combinational verification technique where the functional specification of a circuit under verification is utilized to simplify the verification task. The main id...
Evguenii I. Goldberg, Yuji Kukimoto, Robert K. Bra...