706 search results - page 11 / 142 » On a quasi-ordering on Boolean functions |
JACIII
2007
13 years 7 months ago
2007
We study the problem of approximating pseudoBoolean functions by linear pseudo-Boolean functions. Pseudo-Boolean functions generalize ordinary Boolean functions by allowing the fu...
COCO
2003
Springer
14 years 26 days ago
2003
Springer
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
COCO
2011
Springer
12 years 7 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
CL
2000
Springer
13 years 11 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
JCT
2006
13 years 7 months ago
2006
A Boolean function with an even number n = 2k of variables is called bent if it is maximally nonlinear. We present here a new construction of bent functions. Boolean functions of ...