81 search results - page 3 / 17 » Empirical Lower Bounds on the Complexity of Translational Eq... |
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in thr...
IEICET
2006
13 years 7 months ago
2006
This paper investigates some relations among four complexities of sequence over countably infinite alphabet, and shows that two kinds of empirical entropies and the self-entropy r...
CIE
2006
Springer
13 years 11 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
STOC
2012
ACM
11 years 9 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
COCO
2009
Springer
14 years 1 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...