Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On learning monotone Boolean functions with irrelevant variables
-
V. V. Osokin
Veröffentlicht/Copyright:
8. Juli 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
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- 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
Artikel in diesem Heft
- 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
