The equivalence of Horn and network complexity for Boolean functions

This publication has 5 references indexed in Scilit:

• Complete problems for deterministic polynomial time
  Theoretical Computer Science, 1976
• The network complexity and the Turing machine complexity of finite functions
  Acta Informatica, 1976
• Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
  Archive for Mathematical Logic, 1974
• Rekursive Funktionen und ihre Komplexität
  Published by Springer Nature ,1974
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971