A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On a quasi-ordering on Boolean functions
2008
Theoretical Computer Science
It was proved few years ago that classes of Boolean functions definable by means of functional equations [O. Ekin, S. Foldes, P.L. Hammer, L. Hellerstein, Equational characterizations of boolean functions classes, Discrete Mathematics 211 (2000) 27-51], or equivalently, by means of relational constraints [N. Pippenger. Galois theory for minors of finite functions, Discrete Mathematics 254 (2002) 405-419], coincide with initial segments of the quasi-ordered set (Ω , ≤) made of the set Ω of
doi:10.1016/j.tcs.2008.01.025
fatcat:2yxiscdhqjajppihu3znqrtpsm