A New Method for Proving Lower Bounds in the Model of Algebraic Decision Trees

Kristel Unger. A New Method for Proving Lower Bounds in the Model of Algebraic Decision Trees. In Jürgen Dassow, Jozef Kelemen, editors, Aspects and Prospects of Theoretical Computer Science, 6th International Meeting of Young Computer Scientists, Smolenice, Czechoslovakia, November 19-23, 1990, Proceedings. Volume 464 of Lecture Notes in Computer Science, pages 271-277, Springer, 1990.

Abstract

Abstract is missing.