486 search results - page 49 / 98 » Improved upper bounds for 3-SAT |
COMPGEOM
2006
ACM
15 years 1 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
80
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
108
click to vote
JCST
2008
14 years 9 months ago
2008
Detecting duplicates in data streams is an important problem that has a wide range of applications. In general, precisely detecting duplicates in an unbounded data stream is not fe...