- Ajtai , M , Komlós , J. and Szemerédi , E. 1981 . The longest path in a random graph . Combinatorial , 1 : 1 – 12 .
- Angluin , D. and Valiant , L. G. 1979 . Fast probabilistic algorithms for Hamiltonian circuits and matchings . J. Comput. Syst. Sci. , 18 : 155 – 193 .
- Barndorff-Nielsen , O. E. and Cox , D. R. 1989 . Asymptotic Techniques for Use in Statistics , London : Chapman and Hall .
- Billingsley , P. 1986 . Probability and Measure , New York : Wiley .
- Bollobás , B. 1985 . Random graphs , New York : Academic Press .
- Erdos , P. , Rényi , A. and Sós , V. T. 1966 . On a problem of graph theory . Studia Scientarium Mathematicarum Hunganica , : 1
- Feller , W. 1971 . An Introduction to Probability Theory and its Applications , Vol. 2 , New York : Wiley .
- Gerbessiotis , A. V . 1998 . A graph-theoretic result for a model of neural computation , Discrete Applied Mathematics Vol. 82 , 257 – 262 . Elsevier Science B.V .
- Rényi , A. Probability Theory , Budapest : Akademiai Kiado .
- Valiant , L. G. 1984 . A theory of the leamable . Communications of the ACM , 27 : 1134 – 1142 .
- Valiant , L. G. 1988 . “ Functionality in neural nets ” . In Proceedings of the American Association for Artificial Intelligence Vol. 2 ,
- Valiant , L. G. 1995 . Circuits of the Mind , Oxford : Oxford University Press .
International Journal of Computer Mathematics
Volume 80, 2003 - Issue 6