Towards a computational theory of statistical tests

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 406-416

  Blum, Manuel ^a   Goldreich, Oded ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

STATISTICAL TESTS;

COMPUTATIONAL THEORIES; COUNTER MACHINES;

STATISTICS;

EID: 84950927293     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267749     Document Type: Conference Paper

References (22)

1. Blum, M., and Goldreich, O., "Towards a Computational Theory of Statistical Tests", TR 747, Computer Science Dept., Technion, Haifa, Israel, 1992.
2. Blum, M., and Micali, S., "How to Generate Cryptograph-ically Strong Sequences of Pseudo-Random Bits", SIAM Jour, on Computing, Vol. 13, 1984, pp. 850-864. Extended abstract in FOCS 82.
3. Chaitin, G., "A Theory of Program Size Formally Identical to Information Theory", IBM Yorktown Heights Rep. RC 4805, April 1974.
4. Dembo, A., and O. Zeitouni, Large Deviation and Applications, preprint, 1991.
5. Fredricksen, H.M., "Generation of the Ford sequence of length 2nd, n large", Journal of Combinatorial Theory, Series A, Vol. 12 (1972), pp. 153-154.
6. Goldwasser, S., and S. Micali, "Probabilistic Encryption", JCSS, Vol. 28, No. 2, 1984, pp. 270-299. Extended abstract in STOC 82.
7. Gnedenko, B.V., The Theory of Probability, (translated from fourth Russian edition by B.D. Seckler), Chelsea Publishing Company, New York (NY), 1968.
8. Hastad, J., R. Impagliazzo, L.A. Levin, and M.G. Luby, "Pseudorandom Generators from any One-Way Functions", preprint. Combines a work of Impagliazzo, Levin and Luby in 21st STOC (1989) with a work of Hastad in 22nd STOC (1990).
9. Kemeny, J.G., and J.L. Snell, Finite Markov Chains, D. Van Nostrad Company, Inc., Princeton (NJ), 1960.
10. Knuth, D.E., The Art of Computer Programming, Vol. 2 (Seminumerical Algorithms), Addison-Wesley Publishing Company, Inc., 1969 (first edition) and 1981 (second edition).
11. Kolmogorov, A.N., "Three Approaches to the Quantitative Definition of Information", Probl. Inform. Transmission, Vol. 1, pp. 1-7, 1965.
12. Lempel, A., and J. Ziv, "On the Complexity of Finite Sequences", IEEE Trans, on Information Theory, Vol. IT-22, No. 1, Jan. 1976, pp. 75-81.
13. L.A. Levin, "Average Case Complete Problems", SIAM J. of Computing, Vol. 15, 1986, pp. 285-286.
14. L.A. Levin, "One-way Functions and Pseudorandom Generators", Combinatorica, Vol. 7, No. 4, 1987, pp. 357-363.
15. Martin-Lof, P., "The Definition of Random Sequences", Inform. Contr., Vol. 9, pp. 602-619, 1966.
16. N. Nisan, "Pseudorandom Generators for Space Bounded Machines", 22nd STOC, 1990.
17. N. Nisan, "RL C SC", 23rd STOC, 1991.
18. Rousseau-Egele, W., "Un Theoreme de la Limite Locale pour une Classe de Transformations Dilatantes et Monotones par Morceaux", Ann. Prob., 11 (1983), pp. 772-788.
19. Solomonoff, R.J., "A Formal Theory of Inductive Inference", part 1 and 2, Information and Control, Vol. 7, 1964, pp. 1-22 ans 224-254.
20. Yao, A.C., "Theory and Applications of Trapdoor Functions", 23rd FOCS, 1982, pp. 80-91.
21. Ziv. J., and A. Lempel, "A Universal Algorithm for Sequential Data Compression", IEEE Trans, on Information Theory, Vol. IT-23, No. 3, May 1977, pp. 337-343.
22. Ziv, J., and N. Merhav, "A Measure of Relative Entropy between Individual Sequences with Applications to Universal Classification", preprint.