141 search results - page 9 / 29 » dcg 2008 |
120
click to vote
DCG
2006
15 years 3 months ago
2006
We use circular sequences to give an improved lower bound on the minimum number of ( k)
123
click to vote
DCG
2006
15 years 3 months ago
2006
Abstract. We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where k(d, n) = ,, d 1 + log((d + n)/d)
DCG
2000
15 years 3 months ago
2000
We provide a multiple purpose algorithm for generating oriented matroids. An application disproves a conjecture of Gr
132
Voted
DCG
2000
15 years 3 months ago
2000
This paper addresses three questions related to minimal triangulations of a 3-dimensional convex polytope P.