Sciweavers

3208 search results - page 111 / 642
» A Lower Bound for Primality
Sort
View
ICALP
2003
Springer
15 years 11 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
DCG
2006
96views more  DCG 2006»
15 years 6 months ago
k-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
We use circular sequences to give an improved lower bound on the minimum number of ( k)
József Balogh, Gelasio Salazar
EJC
2000
15 years 6 months ago
On Intersection Sets in Desarguesian Affine Spaces
Lower bounds on the size of t-fold blocking sets with respect to hyperplanes or t-intersection sets in AG(n, q) are obtained, some of which are sharp.
Simeon Ball
CVPR
2009
IEEE
17 years 1 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
CIE
2010
Springer
15 years 11 months ago
Circuit Complexity and Multiplicative Complexity of Boolean Functions
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
Arist Kojevnikov, Alexander S. Kulikov