451 search results - page 24 / 91 » Some Lower Bounds on Geometric Separability Problems |
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
67
Voted
ENTCS
2008
14 years 9 months ago
2008
The problem of "time separation" can be stated as follows: Given a system made of several connected components, each one entailing a local delay known with uncertainty, ...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
JCT
2011
14 years 4 months ago
2011
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...