102 search results - page 3 / 21 » On the Complexity of Boolean Functions in Different Characte... |
CPC
2004
13 years 8 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...
BMCBI
2005
13 years 8 months ago
2005
Background: Cells react to changing intra- and extracellular signals by dynamically modulating complex biochemical networks. Cellular responses to extracellular signals lead to ch...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
—We present a method to eliminate redundancy in the transition tables of Boolean automata: schema redescription with two symbols. One symbol is used to capture redundancy of indi...
CIE
2006
Springer
14 years 8 days ago
2006
Springer
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
ALT
2010
Springer
13 years 8 months ago
2010
Springer
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...