72 search results - page 5 / 15 » stoc 2003 |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
STOC
2003
ACM
15 years 10 months ago
2003
ACM
STOC
2003
ACM
15 years 10 months ago
2003
ACM
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica, 1995]. For a graph G, let dim(G) be the smallest d such that G occ...