Skip to main content
SpringerLink
Log in

Honest iteration schemes of randomizing algorithms

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 650))

Included in the following conference series:

  • 124 Accesses

Abstract

This paper further studies Blass and Gurevich's iteration schemes of randomizing algorithms for randomized reductions [BG91]. An iteration scheme of a randomizing algorithm is honest if it passes a bit to a process independently of its value. We show that if a fair iteration scheme is honest, then it is independent. This implies the previous known sufficient condition for independence in [BG91]. On the other hand, we show that for independence, honesty is not necessary.

Supported in part by NSF grant CCR-9108899.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Ben-David, B. Chor, O. Goldreich, and M. Luby, On the theory of average case complexity, Proc. 21st Annual ACM Symposium on Theory of Computing, 1989, pp.204–216.

    Google Scholar 

  2. A. Blass and Y. Gurevich, Randomizing reductions of search problems, Proceedings of Foundations of Software Technology and Theoretical Computer Science (Invited Talk), New Delhi, India, 1991, pp. 10–24.

    Google Scholar 

  3. Y. Gurevich, Average case completeness, J. of Computer and System Sciences, 42(1991), pp. 346–398.

    Article  Google Scholar 

  4. R. Impagliazzo and L. Levin, No better ways to generate hard NP instances than picking uniformly at random, Proc. 31th IEEE Symposium on Foundations of Computer Science, 1990, pp. 812–821.

    Google Scholar 

  5. L. Levin, Average case complete problems, SIAM J. on Computing, 15(1986), pp. 285–286. Extended abstract appeared in Proc. 16th ACM Symposium on Theory of Computing, 1984, p. 465.

    Article  Google Scholar 

  6. R. Venkatesan and L. Levin, Random instances of a graph coloring problem are hard, Proc. 20th ACM Symposium on Theory of Computing, 1988, pp. 217–222.

    Google Scholar 

  7. R. Venkatesan, Average Case Intractability, Ph.D. thesis, Computer Science Department, Boston University, 1991.

    Google Scholar 

  8. R. Venkatesan and S. Rajagopalan, Average case intractability of Diophantine and matrix problems, Proc. of 24th ACM Symposium of Theory of Computing, May 1992, pp. 632–642.

    Google Scholar 

  9. J. Wang and J. Belanger, On average P vs. average NP, Proc. of the 7th IEEE Conference on Structure in Complexity Theory, June 1992, pp. 318–326.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilkes University, 18766, Wilkes-Barre, PA, USA

    Jie Wang & Jay Belanger

Authors
  1. Jie Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jay Belanger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Toshihide Ibaraki Yasuyoshi Inagaki Kazuo Iwama Takao Nishizeki Masafumi Yamashita

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, J., Belanger, J. (1992). Honest iteration schemes of randomizing algorithms. In: Ibaraki, T., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds) Algorithms and Computation. ISAAC 1992. Lecture Notes in Computer Science, vol 650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56279-6_79

Download citation

  • DOI: https://doi.org/10.1007/3-540-56279-6_79

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56279-5

  • Online ISBN: 978-3-540-47501-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation