706 search results - page 17 / 142 » On a quasi-ordering on Boolean functions |
PQCRYPTO
2010
13 years 11 months ago
2010
We give exact formulas for the growth of the ideal Aλ for λ a quadratic element of the algebra of Boolean functions over the Galois field GF(2). That is, we calculate dim Akλ w...
ACISP
2000
Springer
14 years 11 hour ago
2000
Springer
This paper shows how suitable choice of cost function can significantly affect the power of optimisation methods for the synthesising of Boolean functions. In particular we show ...
COCO
2009
Springer
13 years 11 months ago
2009
Springer
Every Boolean function on n variables can be expressed as a unique multivariate polynomial modulo p for every prime p. In this work, we study how the degree of a function in one c...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
TCS
2008
13 years 7 months ago
2008
It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...