Introduction to finite fields and their applications
Introduction to finite fields and their applications
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
Adaptive versus nonadaptive attribute-efficient learning
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Coding Theory: The Essentials
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
| Hi-index | 0.00 |
We design asymptotically optimal query strategies for the class of parity functions which contain at most k essential variables. The number of questions asked is at most twice the number asked by an optimal strategy. The strategy presented is even non-adaptive. For fixed k, the number of questions is optimal up to additive constants. Our results improve upon results by Uehara, Tsuchida and Wegener [6].