A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity

Hans Dietmar Gröger. A New Partition Lemma for Planar Graphs and Its Application to Circuit Complexity. In Lothar Budach, editor, Fundamentals of Computation Theory, 8th International Symposium, FCT 91, Gosen, Germany, September 9-13, 1991, Proceedings. Volume 529 of Lecture Notes in Computer Science, pages 220-229, Springer, 1991.

Abstract

Abstract is missing.