Sciweavers

47 search results - page 4 / 10
» Influences of monotone Boolean functions
Sort
View
DM
2006
73views more  DM 2006»
13 years 7 months ago
Composition of Post classes and normal forms of Boolean functions
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
Miguel Couceiro, Stephan Foldes, Erkko Lehtonen
TBILLC
2005
Springer
14 years 1 months ago
Natural Logic for Natural Language
We implement the extension of the logical consequence relation to a partial order ≤ on arbitary types built from e (entities) and t (Booleans) that was given in [1], and the deï...
Jan van Eijck
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
13 years 11 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
AMAI
2008
Springer
13 years 7 months ago
Recognition of interval Boolean functions
Interval functions constitute quite a special class of Boolean functions for which it is very easy and fast to determine their functional value on a specified input vector. Their ...
Ondrej Cepek, David Kronus, Petr Kucera
APPROX
2007
Springer
153views Algorithms» more  APPROX 2007»
14 years 1 months ago
Distribution-Free Testing Lower Bounds for Basic Boolean Functions
: In the distribution-free property testing model, the distance between functions is measured with respect to an arbitrary and unknown probability distribution D over the input dom...
Dana Glasner, Rocco A. Servedio