740 search results - page 3 / 148 » Lower bounds for Buchsbaum* complexes |
IPL
2000
14 years 9 months ago
2000
We obtain an exponential lower bound on the non-linear complexity of the new pseudo-random function, introduced recently by M. Naor and O. Reingold. This bound is an extension of t...
ECCC
2002
14 years 9 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
IPL
2002
14 years 9 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
DLT
2009
14 years 7 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness...