4255 search results - page 85 / 851 » On Learning Boolean Functions |
128
click to vote
ISCAS
2006
IEEE
15 years 7 months ago
2006
IEEE
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
DM
2008
15 years 1 months ago
2008
By the relationship between the Walsh spectra at partial points and the Walsh spectra of its sub-functions, by the action of general linear group on the set of Boolean functions, ...
126
click to vote
AML
2010
15 years 1 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
110
click to vote
JCT
2010
15 years 5 days ago
2010
In [11], Kalai investigated the probability of a rational outcome for a generalized social welfare function (GSWF) on three alternatives, when the individual preferences are unifo...
105
click to vote
COCO
2007
Springer
15 years 8 months ago
2007
Springer
We study the link between the complexity of a polynomial and that of its coefficient functions. Valiant’s theory is a good setting for this, and we start by generalizing one of V...