Article
Licensed
Unlicensed
Requires Authentication
On learning monotone Boolean functions with irrelevant variables
-
V. V. Osokin
Published/Copyright:
July 8, 2010
Abstract
The problem of learning a function in the context of the exact model of learning using membership queries consists in reconstruction of this function table of values using membership queries. Here we obtain the order of complexity of learning monotone Boolean functions with irrelevant variables.
Received: 2009-07-28
Published Online: 2010-07-08
Published in Print: 2010-July
© de Gruyter 2010
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- A limit theorem for the logarithm of the order of a random A-permutation
- On game-theoretic characterisation of stochastic independence
- On the potential divisibility of matrices over distributive lattices
- On learning monotone Boolean functions with irrelevant variables
- Barriers of perfectly balanced Boolean functions
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
Articles in the same Issue
- A limit theorem for the logarithm of the order of a random A-permutation
- On game-theoretic characterisation of stochastic independence
- On the potential divisibility of matrices over distributive lattices
- On learning monotone Boolean functions with irrelevant variables
- Barriers of perfectly balanced Boolean functions
- On the classification of Post automaton bases by the decidability of the A-completeness property for definite automata
