The complexity of exactly learning algebraic concepts: (extended abstract)

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

Volumn 1160, Issue , 1996, Pages 100-112

  Arvind, V ^a   Vinodchandran, N V ^a  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; EQUIVALENCE CLASSES; GROUP THEORY; LEARNING ALGORITHMS;

COMPLEXITY CLASS; COMPLEXITY THEORY; EQUIVALENCE QUERIES; EXTENDED ABSTRACTS; MEMBERSHIP QUERY; PERMUTATION GROUP; REPRESENTATION CLASS; TEACHING ASSISTANTS;

LEARNING SYSTEMS;

EID: 84949215171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61863-5_38     Document Type: Conference Paper

References (14)

1. D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
2. D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121-150, 1990.
3. A. Blummer, A. Ehrenfeucht, D. Haussler and M Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4):929-965, 1989.
4. J. L. Balcázar, J. Díaz, R. Gavalda and O. Watanabe. A note on the query complexity of learning DFA. Proceedings of the Third Workshop on Algorithmic Learning Theory, 53-62, 1992.
5. S. Fenner, L. Fortnow, S. Kurtz. Gap-definable counting classes. Proc. 6th Structure in Complexity Theory Conference, 30-42, 1991.
6. M. Furst, J. E. Hopcroft and E. Luks. Polynomial time algorithms for permutation groups. Proc. 21st IEEE Symposium of Foundations of Computer Science, 36-45, 1980.
7. R. Gavaldà. On the power of equivalence queries. EUROCOLT, 193-203, 1993.
8. M. Hall. The Theory of Groups. Macmillan, New York, 1959.
9. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan and D. Vilkins. How many queries are needed to learn? Proc. of the 27th Symposium on the Theory of Computing, 190-199, 1995.
10. K. Hoffmann and R. Kunz. Linear Algebra. Prentice Hall Inc., 1971.
11. J. Köbler, U. Schöning, J. Torán. Graph isomorphism is low for PP. Journal of Computational Complexity, 2: 301-310, 1992.
12. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
13. O. Watanabe. A formal study of learning via queries. 17th International Colloquium on Automata, Languages and Programming, LNCS 443: 139-152, 1990.
14. O. Watanabe and R. Gavaldà. Structural analysis of polynomial time query learnability. Mathematical Systems Theory, 27:231-256, 1994.