Skip to main content
SpringerLink
Log in

Circuits in bounded arithmetic part I

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

We show that the following relationships hold:

where the inclusions are strict.

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. M. Ajtai, ∑ 21 -formulae on finite structures, Ann. Pure Appl. Logic 24 (1983) 1–48.

    Google Scholar 

  2. S.R. Buss,Bounded Arithmetic (Bibliopolis, 1986). Revision of Ph.D. dissertation, Princeton University (1985).

  3. M. Furst, J.B. Saxe and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Math. Sys. Theory 17 (1984) 13–27.

    Google Scholar 

  4. J. Håstad, Computational limitations for small depth circuits, PhD thesis, MIT (1986).

  5. N. Immerman, Expressibility and parallel complexity (1987; revised August 1988).

  6. I. Wegener,The Complexity of Boolean Functions (Wiley-Teubner series in Computer Science, Stuttgart, 1987).

  7. A.C. Yao, Separating the polynomial time hierarchy by oracles: Part I,Proc. 26th Annual IEEE Symp. on Foundation of Computer Science (1985) pp. 1–10.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, The Graduate School and University Center of The City University of New York, 33 West 42nd Street, 10036-8099, New York, NY, USA

    Spyro-Giorgio Mantzivis

Authors
  1. Spyro-Giorgio Mantzivis
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mantzivis, SG. Circuits in bounded arithmetic part I. Ann Math Artif Intell 6, 127–156 (1992). https://doi.org/10.1007/BF01531025

Download citation

  • Issue Date:

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

Keywords

Search

Navigation