46 search results - page 1 / 10 » On the topological lower bound for the multichromatic number |
DM
2010
13 years 3 months ago
2010
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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...
DCG
2008
13 years 4 months ago
2008
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...
JCT
2007
13 years 4 months ago
2007
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...
STOC
1992
ACM
13 years 8 months ago
1992
ACM
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...