The network-complexity of equivalence and other applications of the network complexity

Extended abstract
  • C. P. Schnorr
Mittwochvormittag Hauptvortrag
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)


  1. 1.
    Cook, S.A.: The Complexity of Theorem-Proving Procedures. Symposium on Theory of Computing 1971. 151–158Google Scholar
  2. 2.
    Fischer, M.J.: Lectures on Network Complexity. Preprint Universität Frankfurt, 1974Google Scholar
  3. 3.
    Karp, R.M.: Reducibility among Combinatorial Problems. in: Complexity of Computer Computations. R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York (1972) 85–104CrossRefGoogle Scholar
  4. 4.
    Paul, W.J.: 2.25N — Lower Bound on the Combinational Complexity of Boolean Functions. Symposium on Theory of Computing, 1975Google Scholar
  5. 5.
    Schnorr, C.P.: The Combinational Complexity of Equivalence. Preprint Universität Frankfurt 1975, to appear in Theoretical Computer ScienceGoogle Scholar
  6. 6.
    Schnorr, C.P.: Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen. Computing 13, (1974)Google Scholar
  7. 7.
    Schnorr, C.P.: The Network Complexity and the Turing Machine Complexity of Finite Functions. Preprint Universität Frankfurt, 1975Google Scholar
  8. 8.
    Schnorr, C.P.: Satisfiability is Quasi-Linear Complete in NQL. Preprint Universität Frankfurt, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • C. P. Schnorr
    • 1
  1. 1.Fachbereich MathematikUniversität FrankfurtGermany

Personalised recommendations