707 search results - page 2 / 142 » The Nonhomomorphicity of Boolean Functions |
CPAIOR
2007
Springer
15 years 3 months ago
2007
Springer
A linear pseudo-Boolean constraint (LPB) is an expression of the form a1 · 1 + . . . + am · m ≥ d, where each i is a literal (it assumes the value 1 or 0 depending on whether a...
MFCS
2004
Springer
15 years 2 months ago
2004
Springer
In learning theory and genetic programming, OBDDs are used to represent approximations of Boolean functions. This motivates the investigation of the OBDD complexity of approximatin...
63
Voted
ISMVL
2002
IEEE
15 years 2 months ago
2002
IEEE
A generalization of McMillan’s conjunctive expansion of Boolean functions [1] to the case of multiple-valued input binary-valued output functions is presented. It is based on th...
123
Voted
DAC
2006
ACM
15 years 10 months ago
2006
ACM
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
FSE
2004
Springer
15 years 3 months ago
2004
Springer
Recent research shows that the class of Rotation Symmetric Boolean Functions (RSBFs), i.e., the class of Boolean functions that are invariant under circular translation of indices,...