Resource bounded measure and learnability

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 261-270

  Lindner, W ^a   Schuler, R ^a   Watanabe, O ^b  

^a UNIVERSITY OF ULM   (Germany)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BOOLEAN CIRCUIT; LEARNABILITY; POLYNOMIAL SIZE; POLYNOMIAL-TIME; RESOURCE-BOUNDED MEASURE;

POLYNOMIAL APPROXIMATION;

EID: 0342604172     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694620     Document Type: Conference Paper

References (21)

1. E. Allender and M. Strauss. Measure on small complexity classes, with applications for BPP. In Proceedings of the 35thAnnual IEEE Symposium on Foundations of Computer Science, pages 807-818. IEEE Computer Society Press, 1994.
2. E. Allender and M. Strauss. Measure on P: Robustness of the notion. In Proceedings of the 20th Mathematical Foundations of Computer Science. Springer-Verlag, 1995.
3. K. Ambos-Spies, S.A. Terwijn, and X. Zheng. Resource bounded randomness and weakly complete problems. Theoretical Computer Science, 172(1-2):195-207, 1997.
4. D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
5. D. Angluin and M. Kharitonov.When won'tmembership queries help? Journal of Computer and System Science, 50:336-355, 1995.
6. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science, pages 16-25. IEEE Computer Society Press, 1990.
7. L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307-318, 1993.
8. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam's razor. Information Processing Letters, 24(6):377-380, 1987.
9. H. Buhrman, D.van Melkebeek, K. W. Reagan, D. Sivakumar, and M. Strauss. A generalization of resource bounded measure, with an application. In Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of LNCS, pages 161-171. Springer-Verlag, 1998.
10. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792-807, October 1984.
11. O. Goldreich and L. Levin. A hard-core predicate for all one-way functions. In Proceedings of the 21st Annual ACMSymposiumon Theory of Computing, 1989.
12. R.L. Graham, D.E. Knuth, and O. Pataschnik. Concrete Mathematics. AddisonWesley, 1989.
13. Russell Impagliazzo, Leonid A. Levin, and Michael Luby. Pseudo-random generation from one-way functions. In Proceedings of the 21st Annual ACMSymposium on Theory of Computing, pages 12-24, Seattle, 1989. ACM.
14. J. Köbler andW. Lindner. Oracles in p2 are sufficient for exact learning. In Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, pages 277-290. Springer, 1997.
15. N. Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
16. M. Luby. Pseudorandomness and Cryptographic Applications. Princeton, 1996.
17. J. Lutz. Almost everywhere high nonuniform complexity. Journal of Computer and System Sciences, 44:220-258, 1992.
18. N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49:149-167, 1994.
19. K.W. Regan, D. Sivakumar, and Jin-Yi Cai. Pseudorandom generators, measure theory, and natural proofs. In Proceedings of the 36thAnnual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, 1995.
20. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
21. A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 80-91. IEEE Computer Society Press, 1982.