535 search results - page 1 / 107 » Checking Computations in Polylogarithmic Time |
STOC
1991
ACM
13 years 10 months ago
1991
ACM
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
We show1 that non-deterministic time NTIME(n) is not contained in deterministic time n 2and polylogarithmic space, for any > 0. This implies that (infinitely often) satisfiabi...
FOCS
2010
IEEE
13 years 4 months ago
2010
IEEE
PODC
2009
ACM
14 years 7 months ago
2009
ACM
Peer-to-peer systems rely on scalable overlay networks that enable efficient routing between its members. Hypercubic topologies facilitate such operations while each node only nee...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
The paper presents a deterministic distributed algorithm that given an n node unweighted graph constructs an O(n3/2 ) edge 3-spanner for it in O(log n) time. This algorithm is the...