706 search results - page 74 / 142 » On a quasi-ordering on Boolean functions |
ISAAC
1995
Springer
14 years 18 days ago
1995
Springer
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. ...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
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...
ALIFE
2006
13 years 9 months ago
2006
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...
CORR
2006
Springer
13 years 9 months ago
2006
Springer
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...
JACM
2002
13 years 8 months ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...