Sciweavers

707 search results - page 139 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
BMCBI
2008
201views more  BMCBI 2008»
13 years 8 months ago
A copula method for modeling directional dependence of genes
Background: Genes interact with each other as basic building blocks of life, forming a complicated network. The relationship between groups of genes with different functions can b...
Jong-Min Kim, Yoon-Sung Jung, Engin A. Sungur, Kap...
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 8 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets
ECCC
2010
124views more  ECCC 2010»
13 years 8 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
EC
2006
121views ECommerce» more  EC 2006»
13 years 7 months ago
A Study of Structural and Parametric Learning in XCS
The performance of a learning classifier system is due to its two main components. First, it evolves new structures by generating new rules in a genetic process; second, it adjust...
Tim Kovacs, Manfred Kerber
ECCC
2007
122views more  ECCC 2007»
13 years 7 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam