Sciweavers

112 search results - page 2 / 23
» On the nonlinearity of monotone Boolean functions
Sort
View
122
Voted
COCOON
2009
Springer
15 years 7 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
106
Voted
ECCC
2008
93views more  ECCC 2008»
15 years 18 days 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
107
Voted
CCCG
2010
15 years 2 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
92
Voted
ISAAC
2004
Springer
105views Algorithms» more  ISAAC 2004»
15 years 6 months ago
On the Monotone Circuit Complexity of Quadratic Boolean Functions
Kazuyuki Amano, Akira Maruoka
FOCS
1998
IEEE
15 years 5 months ago
On Learning Monotone Boolean Functions
Avrim Blum, Carl Burch, John Langford