Results 131 to 140 of about 394 (158)

Learning Monotone Boolean Functions by Uniformly Distributed Examples

SIAM Journal on Computing, 1992
Summary: \textit{L. G. Valiant} [Commun. ACM 27, 1134-1142 (1984; Zbl 0587.68077); Philos. Trans. R. Soc. Lond., A 312, 441-446 (1984; Zbl 0544.68057)] introduced a new computational model of concept learning by example, gave the definition of learnability of classes of Boolean functions, and derived algorithms for learning specific classes of Boolean ...
Qian-Ping Gu, Akira Maruoka
openaire   +1 more source

Fast sequential evaluation of monotonic Boolean functions

Information Sciences, 1980
Abstract A correspondence between the factored form representation of monotonic Boolean functions and the sequential evaluation procedures for them is shown to exist. Based on such a relationship, a criterion is developed for obtaining the cost of the sequential procedure directly from the factored form representation. Making use of this criterion, a
openaire   +1 more source

Replaceability and computational equivalence for monotone boolean functions

Acta Informatica, 1985
Replacement rules have played an important role in the study of monotone boolean function complexity. In this paper, notions of replaceability and computational equivalence are formulated in an abstract algebraic setting, and examined in detail for finite distributive lattices - the appropriate algebraic context for monotone boolean functions.
openaire   +1 more source

Monotonic Boolean functions and incompatible systems of inequalities

USSR Computational Mathematics and Mathematical Physics, 1986
Translation from Zh. Vychisl. Mat. Mat. Fiz. 26, No.10, 1592-1596 (Russian) (1986; Zbl 0611.94014).
openaire   +2 more sources

The realization of monotone Boolean functions (Preliminary Version)

Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76, 1976
In this paper we study the complexity of realizing a monotone but otherwise arbitrary Boolean function. We consider realizations by means of networks and formulae. In both cases the possibility exists that although a monotone function can always be realized in terms of monotone basis functions, a more economical realization may be possible if basis ...
openaire   +1 more source

On the Lyapunov Exponent of Monotone Boolean Networks †

Mathematics, 2020
Ilya Shmulevich, Shmulevich Ilya
exaly  

Clutter Decomposition and Monotonic Boolean Functions*

Annals of the New York Academy of Sciences, 1970
openaire   +2 more sources

On the distribution of the number of monotone Boolean functions relative to the number of lower units

Discrete Mathematics, 2002
I Shmulevich
exaly  

On learning monotone Boolean functions under the uniform distribution

Theoretical Computer Science, 2006
Akira Maruoka
exaly  

Monotone Boolean formulas can approximate monotone linear threshold functions

Discrete Applied Mathematics, 2004
Rocco Servedio
exaly