Skip to main content
SpringerLink
Log in

The Complexity of Finding Top-Toda-Equivalence-Class Members

  • Conference paper
LATIN 2004: Theoretical Informatics (LATIN 2004)

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

Included in the following conference series:

Abstract

We identify two properties that for P-selective sets are effectively computable. Namely we show that, for any P-selective set, finding a string that is in a given length’s top Toda equivalence class (very informally put, a string from Σn that the set’s P-selector function declares to be most likely to belong to the set) is FP\(^{\Sigma^{p}_{2}}\) computable, and we show that each P-selective set contains a weakly-P\(^{\Sigma^{p}_{2}}\)-rankable subset.

Supported in part by NSF grants INT-9815095/DAAD-315-PPP-gü-ab, EIA-0080124, DUE-9980943, and EIA-0205061, and NIH grant P30-AG18254.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bertoni, A., Goldwurm, M., Sabadini, N.: The complexity of computing the number of strings of given length in context-free languages. Theoretical Computer Science 86(2), 325–342 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  2. Denny-Brown, D., Han, Y., Hemaspaandra, L., Torenvliet, L.: Semi-membership algorithms: Some recent advances. SIGACT News 25(3), 12–23 (1994)

    Article  Google Scholar 

  3. Goldberg, A., Sipser, M.: Compression and ranking. SIAM Journal on Computing 20(3), 524–536 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gurevich, Y.: Algebras of feasible functions. In: Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pp. 210–214. IEEE Computer Society Press, Los Alamitos (1983)

    Google Scholar 

  5. Hartmanis, J., Immerman, N.: On complete problems for NP∩coNP. In: Brauer, W. (ed.) ICALP 1985. LNCS, vol. 194, pp. 250–259. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

  6. Hartmanis, J., Yesha, Y.: Computation times of NP sets of different densities. Theoretical Computer Science 34(1-2), 17–32 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hemachandra, L., Rudich, S.: On the complexity of ranking. Journal of Computer and System Sciences 41(2), 251–271 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  8. Hemaspaandra, E., Naik, A., Ogihara, M., Selman, A.: P-selective sets and reducing search to decision vs. self-reducibility. Journal of Computer and System Sciences 53(2), 194–209 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hemaspaandra, L., Hempel, H., Nickelsen, A.: Algebraic properties for deterministic selectivity. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 49–58. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Hemaspaandra, L., Hempel, H., Nickelsen, A.: Algebraic properties for deterministic and nondeterministic selectivity. Technical Report TR-778, Department of Computer Science, University of Rochester, Rochester, NY (May 2002) (revised, May 2003)

    Google Scholar 

  11. Hemaspaandra, L., Hoene, A., Naik, A., Ogiwara, M., Selman, A., Thierauf, T., Wang, J.: Nondeterministically selective sets. International Journal of Foundations of Computer Science 6(4), 403–416 (1995)

    Article  MATH  Google Scholar 

  12. Hemaspaandra, L., Naik, A., Ogihara, M., Selman, A.: Computing solutions uniquely collapses the polynomial hierarchy. SIAM Journal on Computing 25(4), 697–708 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  13. Hemaspaandra, L., Nasipak, C., Parkins, K.: A note on linear-nondeterminism, linearsized, Karp–Lipton advice for the P-selective sets. Journal of Universal Computer Science 4(8), 670–674 (1998)

    MATH  MathSciNet  Google Scholar 

  14. Hemaspaandra, L., Ogihara, M.: The Complexity Theory Companion. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  15. Hemaspaandra, L., Ogihara, M., Wechsung, G.: Reducing the number of solutions of NP functions. Journal of Computer and System Sciences 64(2), 311–328 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Hemaspaandra, L., Ogihara, M., Zaki, M., Zimand, M.: The complexity of finding top-Todaequivalence-class members. Technical Report TR-808, Department of Computer Science, University of Rochester, Rochester, NY (August 2003)

    Google Scholar 

  17. Hemaspaandra, L., Torenvliet, L.: Optimal advice. Theoretical Computer Science 154(2), 367–377 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hemaspaandra, L., Torenvliet, L.: Theory of Semi-Feasible Algorithms. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  19. Hemaspaandra, L., Zaki, M., Zimand, M.: Polynomial-time semi-rankable sets. Journal of Computing and Information 2(1); Special Issue: Proceedings of the 8th International Conference on Computing and Information, pp. 50–67 (1996) CD-ROM ISSN 1201- 8511/V2/#1

    Google Scholar 

  20. Huynh, D.: The complexity of ranking simple languages. Mathematical Systems Theory 23(1), 1–20 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  21. Jockusch, C.: Semirecursive sets and positive reducibility. Transactions of the AMS 131(2), 420–436 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  22. Landau, H.: On dominance relations and the structure of animal societies, III: The condition for score structure. Bulletin of Mathematical Biophysics 15(2), 143–148 (1953)

    Article  Google Scholar 

  23. Naik, A., Rogers, J., Royer, J., Selman, A.: A hierarchy based on output multiplicity. Theoretical Computer Science 207(1), 131–157 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  24. Nickelsen, A.: Polynomial-time partial information classes. Wissenschaft und TechnikVerlag (2001); Also Ph.D. thesis, Technische Universität Berlin, Berlin, Germany (1999)

    Google Scholar 

  25. Nickelsen, A., Tantau, T.: Partial information classes. SIGACT News 34(1) (2003)

    Google Scholar 

  26. Ogihara, M.: Functions computable with limited access to NP. Information Processing Letters 58(1), 35–38 (1996)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  28. Selman, A.: Analogues of semirecursive sets and effective reducibilities to the study of NP complexity. Information and Control 52(1), 36–51 (1982)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  30. Shen, J., Sheng, L., Wu, J.: Searching for sorted sequences in tournaments. SIAM Journal on Computing 32(5), 1201–1209 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  31. Sipser, M.: On relativization and the existence of complete sets. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 523–531. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  32. Tantau, T.: A note on the complexity of the reachability problem for tournaments. Technical Report TR01-092, Electronic Colloquium on Computational Complexity (November 2001), http://www.eccc.uni-trier.de/eccc/

  33. Toda, S.: On polynomial-time truth-table reducibilities of intractable sets to P-selective sets. Mathematical Systems Theory 24(2), 69–82 (1991)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Lane A. Hemaspaandra & Mitsunori Ogihara

  2. Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, 12180

    Mohammed J. Zaki

  3. Department of Computer and Information Sciences, Towson Univ., Baltimore, MD, 21252

    Marius Zimand

Authors
  1. Lane A. Hemaspaandra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mitsunori Ogihara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammed J. Zaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Marius Zimand
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Rutgers University, NJ 08854, Piscataway

    Martín Farach-Colton

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hemaspaandra, L.A., Ogihara, M., Zaki, M.J., Zimand, M. (2004). The Complexity of Finding Top-Toda-Equivalence-Class Members. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24698-5_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21258-4

  • Online ISBN: 978-3-540-24698-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation