XI. Längen von Formeln

  • Ernst Specker
  • Georges Wick
Part of the Lecture Notes in Computer Science book series (LNCS, volume 43)


  1. Fischer, M.J. and Meyer, A.R. and Paterson, M.S., Lower bounds on the size of Boolean formulas: Preliminary report, Paper to be presented at 7th ACM Symp. on Theory of Computing, May 1975.Google Scholar
  2. Harper, L.H. and Savage, J.E., On the complexity of the marriage problem, Adv. in Math. 9, 3(1972) 299–312.Google Scholar
  3. Hodes, L. and Specker, E., Lengths of formulas and elimination of quantifiers I, Contr. to Math. Log. (1968) 175–188.Google Scholar
  4. Nečiporuk, È.I., A Boolean function, Dokl. Akad. Nauk SSSR 169 (1966) 765–766, Engl. Transl.: Soviet Math. Dokl. 7 (1966) 999–1000.Google Scholar
  5. Subbotovskaja, B.A., Comparison of bases in the realization by formulas of functions of the algebra of logic, Dokl. Akad. Nauk SSSR 149 (1963) 784–787, Engl. transl.: Soviet Math. Dokl. 4 (1963) 478–481.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Ernst Specker
  • Georges Wick

There are no affiliations available

Personalised recommendations