Skip to main content
SpringerLink
Log in

Partial Information and Special Case Algorithms

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2001 (MFCS 2001)

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

Abstract

The connection is investigated between two well known notions which deal with languages that show polynomial time behaviour weaker than membership decidability. One notion is polynomial time bi-immunity (p-bi-immunity). The other one is polynomial time \( \mathcal{D} \)-verboseness which captures p-selectivity, p-cheatability, p-verboseness and similar notions, where partial information about the characteristic function is computed. The type of partial information is determined by a family of sets of bitstrings \( \mathcal{D} \).

A full characterization of those \( \mathcal{D} \) for which there are p-bi-immune polynomially \( \mathcal{D} \)-verbose languages is given. Results of the same type for special cases of polynomial \( \mathcal{D} \)-verboseness were already given by Goldsmith, Joseph, Young [GJY93], Beigel [Bei90], and Amir, Gasarch [AG88].

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. A. Amir, R. Beigel, and W. Gasarch. Some connections between bounded query classes and non-uniform complexity. In Proc. 5th Structure in Complexity Theory, pages 232–242, 1990.

    Google Scholar 

  2. A. Amir and W. Gasarch. Polynomial terse sets. Information and Computation, 77:27–56, 1988.

    Article  MathSciNet  Google Scholar 

  3. R. Beigel. Bi-immunity results for cheatable sets. TCS, 73(3):249–263, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. Beigel. Bounded queries to SAT and the boolean hierarchy. Theoretical Computer Science, 84(2):199–223, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  5. R. Beigel, W. Gasarch, and E. Kinber. Frequency computation and bounded queries. In Proc. 10th Structure in Complexity Theory, pages 125–132, 1995.

    Google Scholar 

  6. R. Beigel, M. Kummer, and F. Stephan. Approximable sets. Information and Computation, 120(2):304–314, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  7. R. Beigel, M. Kummer, and F. Stephan. Quantifying the amount of verboseness. Information and Computation, 118(1):73–90, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. Balcázar and U. Schöning. Bi-immune sets for complexity classes. Mathematical Systems Theory, 18:1–10, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Goldsmith, D. Joseph, and P. Young. Self-reducible, P-selective, near-testable, and P-cheatable sets: The effect of internal structure on the complexity of a set. In Proceedings 2nd Structure in Complexity Theory Conference, pages 50–59. IEEE Computer Society Press, 1987.

    Google Scholar 

  10. J. Goldsmith, D. Joseph, and P. Young. A note on bi-immunity and p- closeness of p-cheatable sets in P/Poly. JCSS, 46(3):349–362, 1993.

    MATH  MathSciNet  Google Scholar 

  11. L. A. Hemaspaandra, Z. Jiang, J. Rothe, and O. Watanabe. Polynomial-time multi-selectivity. J. UCS: Journal of Universal Computer Science, 3(3):197–229, 1997.

    MATH  MathSciNet  Google Scholar 

  12. A. Hoene and A. Nickelsen. Counting, selecting, and sorting by query-bounded machines. In Proc. STACS 93, pages 196–205. LNCS 665, 1993.

    Google Scholar 

  13. M. Hinrichs and G. Wechsung. Time bounded frequency computations. Information and Computation, 139(2):234–257, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  14. C. G. Jockusch, Jr. Reducibilities in recursive function theory. PhD thesis, Massachusetts Institute of Technology, Cambridge, Mass., 1966.

    Google Scholar 

  15. A. Nickelsen. On polynomially D-verbose sets. In Proc. STACS 97, pages 307–318, 1997.

    Google Scholar 

  16. A. Nickelsen. Polynomial Time Partial Information Classes. PhD thesis, Technical University of Berlin, 1999.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik und Elektrotechnik, Technische Universität Berlin, 10623, Berlin, Germany

    Arfst Nickelsen

Authors
  1. Arfst Nickelsen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nickelsen, A. (2001). Partial Information and Special Case Algorithms. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_50

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_50

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation