Skip to main content
SpringerLink
Log in

Characterizations of reduction classes modulo oracle conditions

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

It is known that nondeterministic polynomial time truth-table reducibility is exactly the same as nondeterministic polynomial time Turing reducibility. Here we study the standard nondeterministic reducibilities (conjunctive, bounded truth-table, bounded positive truth-table, and many-one) and show that each is a restriction of nondeterministic polynomial time Turing reducibility corresponding to acceptance modulo a set of “oracle conditions.” Then we show that the reduction classes of these reducibilities are classes of formal languages and as such have language theoretic characterization theorems. The same program is carried out for polynomial space.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Book, R., Simple representations of certain classes of languages,J. Assoc. Comput. Mach. 25 (1978), pp. 23–31.

    Google Scholar 

  2. Book, R., Bounded query machines: On NP and PSPACE,Theoret. Comput. Sci. 15 (1981), pp. 27–39.

    Google Scholar 

  3. Book, R., S. Greibach, and B. Wegbreit, Time- and tape-bounded Turing acceptors and AFLs,J. Comput. System Sci. 4 (1970), pp. 606–621.

    Google Scholar 

  4. Book, R., S. Greibach, and C. Wrathall, Reset machines,J. Comput. System Sci. 19 (1979), pp. 256–276.

    Google Scholar 

  5. Book, R., and C. Wrathall, On languages specified by relative acceptance,Theoret. Comput. Sci. 7 (1978), pp. 185–195.

    Google Scholar 

  6. Book, R., and C. Wrathall, Bounded query machines: On NP( ) and NPQUERY( ),Theoret. Comput. Sci. 15 (1981), pp. 41–50.

    Google Scholar 

  7. Ladner, R., N. Lynch, and A. Selman, A comparison of polynomial time reducibilities,Theoret. Comput. Sci. 1 (1975), pp. 103–123.

    Google Scholar 

  8. Savitch, W., Relationships between nondeterministic and deterministic tape complexities,J. Comput. System Sci. 4 (1970), pp. 177–192.

    Google Scholar 

  9. Selman, A., Reductions on NP andP-selective sets,Theoret. Comput. Sci. 19 (1982), pp. 287–304.

    Google Scholar 

  10. Selman, A., Xu Mei-rui, and R. Book, Controlled relativizations of complexity classes,SIAM J. Comput. 12 (1983), pp. 565–579.

    Google Scholar 

  11. Simon, I., On Some Subrecursive Reducibilities, Ph.D. dissertation, Stanford University (1977).

  12. Wrathall, C., Subrecursive Predicates and Automata, Ph.D. dissertation, Harvard University (1975).

  13. Wrathall, C., Rudimentary predicates and relative computation,SIAM J. Comput. 7 (1978), pp. 194–209.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of California at Santa Barbara, 93106, Santa Barbara, California, USA

    Ronald V. Book

  2. Department of Computer Science, Iowa State University, 50011, Ames, Iowa, USA

    Alan L. Selman

Authors
  1. Ronald V. Book
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan L. Selman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by the National Science Foundation under Grants MCS77-23493, MSC80-11979, MCS81-20263, and MCS83-12472. The work of the second author was also supported by the United States-Israel Educational Foundation (Fulbright Award).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Book, R.V., Selman, A.L. Characterizations of reduction classes modulo oracle conditions. Math. Systems Theory 17, 263–277 (1984). https://doi.org/10.1007/BF01744444

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01744444

Keywords

Search

Navigation