One More Method For Proving Lower Bounds on the Formula Complexity of Boolean Functions

Vladimir Stetsenko. One More Method For Proving Lower Bounds on the Formula Complexity of Boolean Functions. In Antoni Kreczmar, Grazyna Mirkowska, editors, Mathematical Foundations of Computer Science 1989, MFCS 89, Porabka-Kozubnik, Poland, August 28 - September 1, 1989, Proceedings. Volume 379 of Lecture Notes in Computer Science, pages 503-510, Springer, 1989.

Abstract

Abstract is missing.