COCO
2008
Springer
13 years 6 months ago
2008
Springer
We prove an exponential lower bound for the size of constant depth multilinear arithmetic circuits computing either the determinant or the permanent (a circuit is called multiline...
MFCS
1997
Springer
13 years 8 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a signiļ¬cant simpliļ¬...
COMPGEOM
2009
ACM
13 years 9 months ago
2009
ACM
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ā Rn such that the volume of their symmetric diļ¬ere...
STOC
2003
ACM
14 years 4 months ago
2003
ACM
