Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1993: Automata, Languages and Programming pp 189–202Cite as

Fault-tolerance and complexity (Extended abstract)

  • Conference paper
  • First Online:

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

Abstract

Robust computation—a radical approach to fault-tolerant database access—was explicitly defined one decade ago, and in the following year this notion was presented at ICALP in Antwerp. A decade's study of robust computation by many researchers has determined which problems can be fault-tolerantly solved via access to databases of many strengths. This paper surveys these results and mentions some interesting unresolved issues.

Supported in part by the National Science Foundation under grants NSF-CCR-8957604 and NSF-INT-9116781/JSPS-ENG-207.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Allender and L. Hemachandra. Lower bounds for the low hierarchy. Journal of the ACM, 39(1):234–250, 1992.

    Google Scholar 

  2. E. Allender and R. Rubinstein. P-printable sets. SIAM Journal on Computing, 17(6):1193–1202, 1988.

    Google Scholar 

  3. V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. In K. Ambos-Spies, S. Homer, and U. Schöning, editors, Complexity Theory. Cambridge University Press. To appear.

    Google Scholar 

  4. V. Arvind, U. Schöning, and R. Schuler. On helping probabilistic oracle machines. Draft, Mar. 1993.

    Google Scholar 

  5. L. Babai, L. Fortnow, and C. Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3–40, 1991.

    Google Scholar 

  6. L. Babai and S. Moran. Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes. Journal of Computer and System Sciences, 36(2):254–276, 1988.

    Google Scholar 

  7. T. Baker, J. Gill, and R. Solovay. Relativizations of the P=?NP question. SIAM Journal on Computing, 4(4):431–442, 1975.

    Google Scholar 

  8. J. Balcázar. Only smart oracles help. Technical Report LSI-88-9, Universitat Politècnica de Catalunya, Facultat d'Informatica, Barcelona, Spain, 1988.

    Google Scholar 

  9. J. Balcázar. Self-reducibility structures and solutions of NP problems. Technical Report LSI-88-19, Universitat Politècnica de Catalunya, Facultat d'Informatica, 1988. Also appears as pages 175–184 of Revista Matematica de la UCM 2 (1989).

    Google Scholar 

  10. J. Balcázar, R. Book, and U. Schöning. Sparse sets, lowness and highness. SIAM Journal on Computing, 15(3):739–746, 1986.

    Google Scholar 

  11. M. Blum and R. Impagliazzo. Generic oracles and oracle classes. In Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pages 118–126, October 1987.

    Google Scholar 

  12. A. Borodin and A. Demers. Some comments on functional self-reducibility and the NP hierarchy. Technical Report TR 76-284, Cornell Department of Computer Science, Ithaca, NY, July 1976.

    Google Scholar 

  13. G. Buntrock, L. Hemachandra, and D. Siefkes. Using inductive counting to simulate nondeterministic computation. Information and Computation, 102(1):102–117, 1993.

    Google Scholar 

  14. J. Cai, L. Hemachandra, and J. Vyskoč. Promise problems and access to unambiguous computation. In Proceedings of the 17th Symposium on Mathematical Foundations of Computer Science, pages 162–171. Springer-Verlag Lecture Notes in Computer Science #629, Aug. 1992.

    Google Scholar 

  15. J. Cai, L. Hemachandra, and J. Vyskoč. Promises and fault-tolerant database access. Technical Report TR-447, University of Rochester, Department of Computer Science, Rochester, NY, 1993. Preliminary version appears in Proceedings of the 17th Symposium on Mathematical Foundations of Computer Science (1992).

    Google Scholar 

  16. P. Crescenzi and R. Silvestri. Sperner's lemma and robust machines. In Proceedings of the 8th Structure in Complexity Theory Conference. IEEE Computer Society Press, 1993. To appear.

    Google Scholar 

  17. J. Díaz and J. Torán. Classes of bounded nondeterminism. Mathematical Systems Theory, 23(1):21–32, 1990.

    Google Scholar 

  18. D. Eppstein, L. Hemachandra, J. Tisdall, and B. Yener. Simultaneous strong separations of probabilistic and unambiguous complexity classes. Mathematical Systems Theory, 25(1):23–36, 1992.

    Google Scholar 

  19. S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 30–42. IEEE Computer Society Press, June/July 1991.

    Google Scholar 

  20. L. Fortnow, J. Rompel, and M. Sipser. On the power of multiple-prover interactive protocols. Manuscript. Preliminary version appears as [21].

    Google Scholar 

  21. L. Fortnow, J. Rompel, and M. Sipser. On the power of multiple-prover interactive protocols. In Proceedings of the 3rd Structure in Complexity Theory Conference, pages 156–161. IEEE Computer Society Press, June 1988. Erratum appears in the same conference's 1990 proceedings, pp. 318–319.

    Google Scholar 

  22. R. Gavaldà. Bounding the complexity of advice functions. In Proceedings of the 7th Structure in Complexity Theory Conference, pages 249–254. IEEE Computer Society Press, June 1992.

    Google Scholar 

  23. R. Gavaldà and J. Balcázar. Strong and robustly strong polynomial time reducibilities to sparse sets. Theoretical Computer Science, 88(1):1–14, 1991.

    Google Scholar 

  24. J. Gill. Computational complexity of probabilistic Turing machines. SIAM Journal on Computing, 6(4):675–695, 1977.

    Google Scholar 

  25. S. Gupta. The power of witness reduction. In Proceedings of the 6th Structure in Complexity Theory Conference, pages 43–59. IEEE Computer Society Press, June/July 1991.

    Google Scholar 

  26. J. Hartmanis and L. Hemachandra. Complexity classes without machines: On complete languages for UP. Theoretical Computer Science, 58:129–142, 1988.

    Google Scholar 

  27. J. Hartmanis and L. Hemachandra. Robust machines accept easy sets. Theoretical Computer Science, 74(2):217–226, 1990.

    Google Scholar 

  28. L. Hemachandra, A. Hoene, M. Ogiwara, A. Selman, T. Thierauf, and J. Wang. Selectivity. In Proceedings of the 5th International Conference on Computing and Information. IEEE Computer Society Press, 1993. To appear.

    Google Scholar 

  29. L. Hemachandra and S. Jain. On the limitations of locally robust positive reductions. International Journal of Foundations of Computer Science, 2(3):237–255, 1991.

    Google Scholar 

  30. L. Hemachandra and S. Jha. Defying upward and downward separation. In Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, pages 185–195. Springer-Verlag Lecture Notes in Computer Science #665, Feb. 1993.

    Google Scholar 

  31. L. Hemachandra, M. Ogiwara, and O. Watanabe. How hard are sparse sets? In Proceedings of the 7th Structure in Complexity Theory Conference, pages 222–238. IEEE Computer Society Press, June 1992.

    Google Scholar 

  32. L. Hemachandra and E. Spaan. Quasi-injective reductions. Theoretical Computer Science. To appear.

    Google Scholar 

  33. R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th ACM Symposium on Theory of Computing, pages 302–309, Apr. 1980.

    Google Scholar 

  34. C. Kintala and P. Fisher. Refining nondeterminism in relativized polynomial-time bounded computations. SIAM Journal on Computing, 9(1):46–53, 1980.

    Google Scholar 

  35. K. Ko. Some observations on the probabilistic algorithms and NP-hard problems. Information Processing Letters, 14(1):39–43, 1982.

    Google Scholar 

  36. K. Ko. On helping by robust oracle machines. Theoretical Computer Science, 52:15–36, 1987.

    Google Scholar 

  37. J. Köbler. Locating P/poly optimally in the extended low hierarchy. In Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science, pages 28–37. Springer-Verlag Lecture Notes in Computer Science #665, Feb. 1993.

    Google Scholar 

  38. R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103–124, 1975.

    Google Scholar 

  39. C. Lautemann. BPP and the polynomial hierarchy. Information Processing Letters, 14:215–217, 1983.

    Google Scholar 

  40. T. Long. Strong nondeterministic polynomial-time reducibilities. Theoretical Computer Science, 21:1–25, 1982.

    Google Scholar 

  41. T. Long and M. Sheu. A refinement of the low and high hierarchies. Technical Report OSU-CISRC-2/91-TR6, Ohio State University, Department of Computer Science, Columbus, Ohio, Feb. 1991.

    Google Scholar 

  42. A. Meyer and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of the 13th IEEE Symposium on Switching and Automata Theory, pages 125–129, 1972.

    Google Scholar 

  43. R. Niedermeier and P. Rossmanith. Unambiguous simulations of auxiliary pushdown automata and circuits. In Proceedings, 1st Latin American Symposium on Theoretical Informatics, pages 387–400. Springer-Verlag Lecture Notes in Computer Science #583, Apr. 1992.

    Google Scholar 

  44. C. Rackoff. Relativized questions involving probabilistic algorithms. Journal of the ACM, 29(1):261–268, 1982.

    Google Scholar 

  45. U. Schöning. A low and a high hierarchy in NP. Journal of Computer and System Sciences, 27:14–28, 1983.

    Google Scholar 

  46. U. Schöning. Robust algorithms: A different approach to oracles. Theoretical Computer Science, 40:57–66, 1985.

    Google Scholar 

  47. U. Schöning. Complexity theory and interaction. In R. Herken, editor, The Universal Turing Machine: A Half-Century Survey, pages 561–580. Oxford University Press, 1988.

    Google Scholar 

  48. U. Schöning. Robust oracle machines. In Proceedings of the 13th Symposium on Mathematical Foundations of Computer Science, pages 93–106. Springer-Verlag Lecture Notes in Computer Science #324, August/September 1988.

    Google Scholar 

  49. A. Selman. P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP. Mathematical Systems Theory, 13:55–65, 1979.

    Google Scholar 

  50. A. Selman. Reductions on NP and P-selective sets. Theoretical Computer Science, 19:287–304, 1982.

    Google Scholar 

  51. A. Selman. A note on adaptive vs. nonadaptive reductions to NP. Technical Report 90-20, State University of New York at Buffalo Department of Computer Science, Buffalo, NY, Sept. 1990.

    Google Scholar 

  52. M. Sipser. Borel sets and circuit complexity. In Proceedings of the 15th ACM Symposium on Theory of Computing, pages 61–69, 1983.

    Google Scholar 

  53. L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3:1–22, 1977.

    Google Scholar 

  54. R. Szelepcsényi. Βk-complete problems and greediness. Manuscript, Mar. 1993.

    Google Scholar 

  55. G. Tardos. Query complexity, or why is it difficult to separate NPA ∩ coNPA from PA by random oracles A. Combinatorica, 9:385–392, 1989.

    Google Scholar 

  56. L. Valiant. The relative complexity of checking and evaluating. Information Processing Letters, 5:20–23, 1976.

    Google Scholar 

  57. J. Vyskoč, Mar. 1993. Personal Communication.

    Google Scholar 

  58. O. Watanabe. On hardness of one-way functions. Information Processing Letters, 27:151–157, 1988.

    Google Scholar 

  59. O. Watanabe. On intractability of the class UP. Mathematical Systems Theory, 24:1–10, 1991.

    Google Scholar 

  60. O. Watanabe and S. Toda. Structural analysis on the complexity of inverting functions. In Proceedings of the 1990 SIGAL International Symposium on Algorithms, pages 31–38. Springer-Verlag Lecture Notes in Computer Science #450, Aug. 1990.

    Google Scholar 

  61. T. Yamakami. Polynomial helpers of robust machines. Manuscript, Dec. 1990.

    Google Scholar 

  62. S. Zachos. Probabilistic quantifiers and games. Journal of Computer and System Sciences, 36:433–451, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Rochester, 14627, Rochester, NY

    Lane A. Hemachandra

Authors
  1. Lane A. Hemachandra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Lingas Rolf Karlsson Svante Carlsson

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hemachandra, L.A. (1993). Fault-tolerance and complexity (Extended abstract). In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-56939-1_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56939-8

  • Online ISBN: 978-3-540-47826-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation