An application of codes to attribute-efficient learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1572, Issue , 1999, Pages 101-110

  Hofmeister, Thomas ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYMPTOTICALLY OPTIMAL; EFFICIENT LEARNING; OPTIMAL STRATEGIES; PARITY FUNCTIONS;

COMPUTATION THEORY;

EID: 84947808532     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49097-3_9     Document Type: Conference Paper

References (6)

1. N. Alon, L. Babai and A. Itai, A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem, Journal of Algorithms 7, 1986, 567-583.
2. P. Damaschke, Adaptive Versus Nonadaptive Attribute-Efficient Learning, Proc. of the 30th Annual ACM Symposium on the Theory of Computing (S-TOC), 1998, 590-596.
3. D. Hoffman, D. Leonard, C. Lindner, K. Phelps, C. Rodger and J. Wall, Coding Theory, the Essentials, Marcel Dekker, 1991.
4. R. Lidl and H. Niederreiter, Introduction to Finite Fields and Their Applications, Cambridge University Press, 1994.
5. W. Peterson and E. Weldon, Error-Correcting Codes, MIT Press, 2nd edition, 1972.
6. R. Uehara, K. Tsuchida and I. Wegener, Identification of Partial Disjunction, Parity, and Threshold Functions, Proc. of the European Conference on Computational Learning Theory (Eurocolt), 1997, 171-184. To appear in Theoretical Computer Science.