In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This imp...
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...