290 search results - page 37 / 58 » Lattice-based computation of Boolean functions |
EOR
2011
13 years 2 months ago
2011
A simple game is a pair consisting of a finite set N of players and a set W ⊆ 2N of winning coalitions. (Vector-)weighted majority games ((V)WMG) are a special case of simple ga...
ASPDAC
2005
ACM
13 years 9 months ago
2005
ACM
Abstract— A disjoint support decomposition (DSD) is a representation of a Boolean function F obtained by composing two or more simpler component functions such that the component...
CF
2008
ACM
13 years 9 months ago
2008
ACM
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
ISMIS
2005
Springer
14 years 1 months ago
2005
Springer
A class of formulas called factored negation normal form is introduced. They are closely related to BDDs, but there is a DPLL-like tableau procedure for computing them that operate...