Sciweavers

1089 search results - page 7 / 218
» Bounds on generalized Frobenius numbers
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Spherical Cubes and Rounding in High Dimensions
What is the least surface area of a shape that tiles Rd under translations by Zd ? Any such shape must have volume 1 and hence surface area at least that of the volume-1 ball, nam...
Guy Kindler, Ryan O'Donnell, Anup Rao, Avi Wigders...
JC
2007
130views more  JC 2007»
13 years 7 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
SODA
2003
ACM
103views Algorithms» more  SODA 2003»
13 years 9 months ago
On the rectilinear crossing number of complete graphs
We prove a lower bound of 0.3288   n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
Uli Wagner
DAM
2007
84views more  DAM 2007»
13 years 7 months ago
Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their ele...
Vera Kurková, Marcello Sanguineti
ENDM
2008
118views more  ENDM 2008»
13 years 7 months ago
Number of Crossing-Free Geometric Graphs vs. Triangulations
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
Andreas Razen, Jack Snoeyink, Emo Welzl