The complexity of symmetric functions in parity normal forms

  • Carsten Damm
Part of the Lecture Notes in Computer Science book series (LNCS, volume 452)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aj83]
    Ajtai, M.: ∑11-formulae on finite structures, Ann. Pure and Applied Logics 24(1983), 1–48Google Scholar
  2. [BW87]
    Brustmann, B., Wegener, I.: The complexity of symmetric functions in bounded depth circuits, Information Processing Letters 25(1987), 217–219Google Scholar
  3. [Di80]
    Diskrete Mathematik und mathematische Fragen der Kybernetik, ed. Burosch, G., Kiesewetter, H., Berlin 1980, 274–277Google Scholar
  4. [DM89]
    Damm,C.,Meinel,Ch.:Separating completely complexity classes related to polynomial size Ω-decision trees, Proc. FCT'89(Szeged), LNCS 380, 127–136Google Scholar
  5. [DGS86]
    Denenberg, L.,Gurevich, Y.,Shelah, S.:Definability by constant-depth polynomial-size circuits, Information and control 70(1986), 216–240Google Scholar
  6. [FKPS85]
    Fagin, R.,Klawe, M.,Pippenger, N.,Stockmeyer, L.: Bounded depth, polynomial size circuits for symmetric functions, Theoretical Computer Science 36(1985), 239–250Google Scholar
  7. [FSS81]
    Furst,M.,Saxe,J.,Sipser,M.:Parity, circuits and the polynomial time hierarchy, Proc. 22nd IEEE FOCS (1981), 260–270Google Scholar
  8. [Hå86]
    Håstad,J.:Almost optimal lower bounds for small depth circuits. Proc. 18th ACM STOC (1986), 6–20Google Scholar
  9. [Ra86]
    Razborov, A.:Lower bounds on the size of bounded depth circuits over the basis {Λ,⊕}, preprint Steklov Inst. for Math., Moscow 1986 (see also Mat. Zam. 41(1987), 598–607)(in Russian)Google Scholar
  10. [Yao85]
    Yao, A.C.: Separating the polynomial time hierarchy by oracles Proc. 26th IEEE FOCS (1985), 1–10Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Carsten Damm
    • 1
  1. 1.Sektion Mathematik, Humboldt-Universität zu BerlinBerlin

Personalised recommendations