Skip to main content
SpringerLink
Log in

Monte-Carlo Polynomial versus Linear Time - The Truth-Table Case

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2001)

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

Included in the following conference series:

Abstract

We show that under some truth-table oracle B there are almost exponential gaps in the (infinite often) hierarchy of bounded-error probabilistic time, in particular BPP Btt = ZPTIME Btt (n). This proves a main theorem in [5], which is extended to the theoretical limit.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Allender, Beigel, Hertrampf, Homer, Almost-everywhere Complexity Hierarchies for Nondeterministic Time, TCS 115(1993), pp. 225–241.

    Article  MATH  MathSciNet  Google Scholar 

  2. Balcazar, Diaz, Gabarro, Structural Complexity 2, Springer 1990.

    Google Scholar 

  3. Berg, Håstad, On the BPP Hierarchy Problem, Technical Report TRITA-NA9702, Royal Inst. of Technology, Stockholm 1997.

    Google Scholar 

  4. Freivalds, Probabilistic two-way Machines, Proc. MFCS, LNCS 118, Springer 1981, pp. 33–45.

    Google Scholar 

  5. Fortnow, Sipser, Probabilistic Computation and Linear Time, ACM Symposium on Theory of Computing (STOC), 1989, pp. 148–156.

    Google Scholar 

  6. Fortnow, Sipser, Retraction of Probabilistic Computation and Linear Time, ACM Symposium on Theory of Computing (STOC), 1997, p. 750.

    Google Scholar 

  7. Hemaspaandra, Complexity Theory Column 11, SIGACT News 26,4 (1995), pp. 5–15.

    Article  Google Scholar 

  8. Karpinski, Verbeek, On the Monte Carlo Space Constructible Functions and Separation Results for Probabilistic Complexity Classes, Information and Computation 75 (1987), pp. 178–189.

    Article  MATH  MathSciNet  Google Scholar 

  9. Karpinski, Verbeek, Randomness, Provability and the Separation of Monte Carlo Time and Space, Computation Theory and Logic, LNCS 270 (1987), pp. 189–207.

    Google Scholar 

  10. Rettinger, Orakelabhängige Zeithierarchiesätze, PhD thesis, FernUniversität Hagen, 1999.

    Google Scholar 

  11. Rackoff, Seiferas, Limitations on Separating Nondeterministic Complexity Classes, SIAM Journal on Computing 10 (1981), pp. 742–745.

    Article  MATH  MathSciNet  Google Scholar 

  12. Seiferas, Fischer, Meyer, Separating Nondeterministic Time Complexity Classes, JACM 25, pp. 146–167.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. of computer science, Theoretische Informatik II, FernUniversität Hagen, D-58084, Hagen, Germany

    Robert Rettinger & Rutger Verbeek

Authors
  1. Robert Rettinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rutger Verbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rettinger, R., Verbeek, R. (2001). Monte-Carlo Polynomial versus Linear Time - The Truth-Table Case. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42487-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation