Efficiently constructible huge graphs that preserve first order properties of random graphs

Lecture Notes in Computer Science

Volumn 3378, Issue , 2005, Pages 66-85

  Naor, Moni ^a   Nussboim, Asaf ^a   Tromer, Eran ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; PROBABILISTIC LOGICS; RANDOM PROCESSES;

CANONICAL RANDOM GRAPHS; FIRST-ORDER GRAPHS; LARGER QUANTIFIER DEPTHS; RANDOM GRAPHS;

GRAPH THEORY;

EID: 24144454582     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30576-7_5     Document Type: Conference Paper

References (23)

1. L. M. Adleman, C. Pomerance and R. S. Rumely, On Distinguishing Prime Numbers from Composite Numbers, Annals of Mathematics, vol. 117, no. 1, 173-206, 1983.
2. N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley and Sons, 1992.
3. L. Babai, Character Sums, Weil's Estimates, and Paradoxical Tournaments, lecture notes, http://people.cs.uchicago.edu/~laci/reu02.dir/paley.pdf
4. B. Bollobás. Random Graphs, Academic Press, 1985.
5. B. Bollobás and P. Erdös, Cliques in Random Graphs, Cambridge Philosophical Society Mathematical Proc., vol. 80, 419-427, 1976.
6. F. R. K. Chung, R. L. Graham and R. M. Wilson, Quasi-random graphs, Combinatorica, vol. 9, 345-362, 1989.
7. A. Ehrenfeucht, An Application of Games to the Completeness Problem for Formalized Theories, Fundamenta Mathematicae, vol. 49, 129-141, 1961.
8. P. Erdös, C. Pomerance and E. Schmutz, Carmichael's Lambda Function, Acta Arithmetica, vol. 58, 363-385, 1991.
9. R. Fagin, Probabilities in Finite Models, Journal of Symbolic Logic, vol. 41, 50-58, 1969.
10. S. Gao and D. Panario, Tests and Constructions of Irreducible Polynomials Over Finite Fields, Foundations of Computational Mathematics (F. Cucker, M. Shub, Eds.), 346-361, Springer, 1997.
11. Y. V. Glebskii, D. I. Kogan, M. I. Liagonkii, V. A. Talanov, Range and Degree of Realizability of Formulas in the Restricted Predicate Calculus, Cybernetics, vol. 5, 142-154, 1976.
12. O. Goldreich, S. Goldwasser, S. Micali, How to Construct Random Functions, Journal of the ACM, vol. 33, no. 4, 276-288, 1985.
13. O. Goldreich, S. Goldwasser, A. Nussboim, On the Implementation of Huge Random Objects, proc. 44th IEEE Symposium on Foundations of Computer Science, 68-79, 2003.
14. R. L. Graham and J. H. Spencer, A Constructive Solution to a Tournament Problem, Canadian Math Bulletin, vol. 14, 45-48, 1971.
15. J. Håstad, R. Impagliazzo, L.A. Levin and M. Luby, A Pseudo-Random Generator from any One-Way Function, SIAM Journal on Computing, vol. 28, num. 4, 1364-1396, 1999.
16. M. Krivelevich and B. Sudakov, Pseudo-random Graphs, preprint, http://www.math.princeton.edu/~bsudakov/papers.html
17. A. Nussboim. Huge Pseudo-Random Graphs that Preserve Global Properties of Random Graphs, M.Sc. Thesis, Advisor: S. Goldwasser, Weizmann Institute of Science, 2003. http://www.wisdom.weizmann.ac.il/~asafn/psdgraphs.ps
18. S. C. Pohlig and M. E. Hellman, An Improved Algorithm for Computing Logarithms Over GF(p) and Its Cryptographic Significance, IEEE Transactions on Information Theory, Vol. IT-24, 106-110, 1978.
19. J. H. Spencer. The Strange Logic of Random Graphs. Springer Verlag, 2001.
20. V. Shoup, New Algorithms for Finding Irreducible Polynomials over Finite Fields, Mathematics of Computation, vol. 54, 435-447, 1990.
21. V. Shoup, Searching for primitive roots in finite fields, Mathematics of Computation, vol. 58, 369-380, 1992.
22. J. H. Spencer and S. Shelah, Zero-One Laws for Sparse Random Graphs, Journal of the American Mathematical Society, vol. 1, 97-115, 1988.
23. A. Thomason, Pseudo-random graphs, Proceedings of Random Graphs, Annals of Discrete Mathematics 33, 307-331, 1987.