Sciweavers

706 search results - page 68 / 142
» On a quasi-ordering on Boolean functions
Sort
View
AML
2010
118views more  AML 2010»
13 years 9 months ago
The modal logic of continuous functions on the rational numbers
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...
Philip Kremer
JCT
2010
81views more  JCT 2010»
13 years 7 months ago
On the probability of a rational outcome for generalized social welfare functions on three alternatives
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...
Nathan Keller
COCO
2007
Springer
106views Algorithms» more  COCO 2007»
14 years 3 months ago
The Complexity of Polynomials and Their Coefficient Functions
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...
Guillaume Malod
AML
2006
87views more  AML 2006»
13 years 9 months ago
The modal logic of continuous functions on cantor space
Abstract 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'...
Philip Kremer
FOCS
1989
IEEE
14 years 1 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan