TOC
2010
13 years 5 months ago
2010
: We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
ICCAD
2009
IEEE
13 years 8 months ago
2009
IEEE
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
TKDE
2002
13 years 10 months ago
2002
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
IPL
2002
13 years 10 months ago
2002
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...
CPC
2004
13 years 10 months ago
2004
We consider boolean functions over n variables. Any such function can be represented (and computed) by a complete binary tree with and or or in the internal nodes and a literal in...
JCSS
2008
13 years 10 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
ALIFE
2006
13 years 11 months ago
2006
An evolutionary system that supports the interaction of neutral and adaptive mutations is investigated. Experimental results on a Boolean function and needle-in-haystack problems s...
ECCC
2010
13 years 11 months ago
2010
An errorless circuit for a boolean function is one that outputs the correct answer or "don't know" on each input (and never outputs the wrong answer). The goal of e...
CCDS
2010
13 years 11 months ago
2010
A boolean function of n boolean variables is correlation-immune of order k if the function value is uncorrelated with the values of any k of the arguments. Such functions are of co...
AMAI
2008
Springer
13 years 11 months ago
2008
Springer
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 ...