Skip to main content
SpringerLink
Log in

Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources

  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

The semi-random source, defined by Sántha and Vazirani, is a general mathematical mode for imperfect and correlated sources of randomness (physical sources such as noise dicdes). In this paper an algorithm is presented which efficiently generates “high quality” random sequences (quasirandom bit-sequences) from two independent semi-random sources. The general problem of extracting “high quality” bits is shown to be related to communication complexity theory, leading to a definition of strong communication complexity of a boolean function. A hierarchy theorem for strong communication complexity classes is proved; this allows the previous algorithm to be generalized to one that can generate quasi-random sequences from two communicating semi-random sources

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. N. Alon, On VV-s result SRP=RP, unpublished manuscript, 1985.

  2. A. Aho, J. Ullman andM. Yannakakis, On Notions of Information Transfer in VLSI Circuits,15th Annual Symp. on Theory of Computing, (1983), 133–139.

  3. M. Blum, Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain,25th, IEEE Symposium on the Foundations of Computer Science (1984).

  4. B. Chor andO. Goldreich, Unbiased Bits from Weak Sources of Randomness,26th IEEE Symposium on the Foundations of Computer Science (1985).

  5. R. Gallager,Information Theory and Reliable Communication, New York: John Wiley, (1986).

    Google Scholar 

  6. B. Chor, O. Goldreich, J. Hastad, J. Friedman, S. Rudich andR. Smolensky, The Bit Extraction Problem ort-Resilient Functions,26th IEEE Symposium on the Foundations of Computer Science, (1985).

  7. P. Elias, The efficient Construction of an Unbiased Random Sequence,Ann. Math. Statist. 43 (1972), 865–870.

    Google Scholar 

  8. El-Gamal andOrlitzky, Randomized Communication Complexity, preprint.

  9. J. Justesen, A class of Constructive Asymptotically Good Algebraic Codes,IEEE Trans. Inform. Theory,18 (1972), 652–656.

    Article  MATH  MathSciNet  Google Scholar 

  10. R. Lipton andR. Sedgewick, Lower bounds for VLSI,Proc. 13th Ann. ACM Symp. on Theory of Computing, (1981), 300–307.

  11. K. Melhorn andE. Schmidt, Las Vegas is better than Determinism in VLSI and Distributed Computing,14th Annual Symp. on Theory of Computing, (1982), 330–337.

  12. J. von Neumann, Various Techniques Used in Connection with Random Digits, Notes by G. E. Forsythe, National Bureau of Standards,Applied Math. Series,12, (1951), 36–38. Reprinted in von Neumann’s Collected Works, Vol 5, Pergamon Press (1963), 768–770.

    Google Scholar 

  13. C. H. Papadimitriou andM. Sipser, Communication complexity,Proc. 14th Ann. ACM Symp. on Theory of Computing, (1982), 196–200.

  14. P. Raghavan, Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs,27th. IEEE Symposium on the Foundations of Computing, (1986).

  15. W. Rudin,Principles of Mathematical Analysis, Third Edition, McGraw-Hill Book Company.

  16. M. Sántha andU. V. Vazirani, Generating Quasi-random Sequences from Semi-random Sources,Journal of Computer Systems and Sciences,33, (1986), 75–87.

    Article  MATH  Google Scholar 

  17. C. Thompson, Area-Time Complexity for VLSI,11th Annual Symp. on Theory of Computing, (1979), 81–88. to appear in JCSS (currently, Proc. STOC 1985).

  18. U. V. Vazirani, Randomness, Adversaries and Computation,Ph. D. Dissertation, U. C. Berkeley, (1986).

  19. U. V. Vazirani andV. V. Vazirani, Trapdoor Pseudo-random Number Generators with Applications to Protocol Design,15th Annual ACM Symp. on Theory of Computing, (1983).

  20. U. V. Vazirani andV. V. Vazirani, Random Polynomial Time is Equal to Semi-Random Polynomial Time,26th. IEEE Symposium on the Foundations of Computer Science, (1985).

  21. U. V. Vazirani andV. V. Vazirani, Sampling a Population with a Semirandom source,Proceedings Sixth Ann. FST-TCS Conference, New Delhi, (1986).

  22. A. Wyner, Wire-tap Channel,Bell System Technical Journal, (1975).

  23. A. C. Yao, Some Complexity Questions related to Distributive computing,Proc. 11th Ann. ACM Symp on the Theory of Computing, (1979), 209–213.

  24. A. Yao, Theory and Applications of Trapdoor Functions,23th IEEE Symposium on the Foundations of Computer Science, (1982).

  25. A. C. Yao, Lower Bounds by Probabilistic Arguments,Proc. 24 Ann. Symp on the Theory of Computing, (1983), 420–428.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, U. C. Berkeley, 94720, Berkeley, CA, USA

    Umesh V. Vazirani

Authors
  1. Umesh V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by an IBM Doctoral Felloswhip and by NSF Grant MCS 82-04506.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vazirani, U.V. Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources. Combinatorica 7, 375–392 (1987). https://doi.org/10.1007/BF02579325

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02579325

AMS subject classification

Search

Navigation