55 search results - page 8 / 11 » stacs 2010 |
133
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
138
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
129
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. It is well-known that Abstract State Machines (ASMs) can simulate “stepby-step” any type of machines (Turing machines, RAMs, etc.). We aim to overcome two facts: 1) s...
148
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
133
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...