Sciweavers

112 search results - page 2 / 23
» On the nonlinearity of monotone Boolean functions
Sort
View
COCOON
2009
Springer
13 years 11 months ago
On the Readability of Monotone Boolean Formulae
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf
ECCC
2008
93views more  ECCC 2008»
13 years 4 months ago
A Note on the Distance to Monotonicity of Boolean Functions
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...
Arnab Bhattacharyya
CCCG
2010
13 years 6 months ago
Any monotone boolean function can be realized by interlocked polygons
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interiordisjoint simple p...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara
FOCS
1998
IEEE
13 years 9 months ago
On Learning Monotone Boolean Functions
Avrim Blum, Carl Burch, John Langford