1331 search results - page 181 / 267 » Complexity bounds for zero-test algorithms |
114
click to vote
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
131
click to vote
WG
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
113
click to vote
VVS
1996
IEEE
15 years 7 months ago
1996
IEEE
We propose a fast algorithm for rendering general irregular grids. Our method uses a sweep-plane approach to accelerate ray casting, and can handle disconnected and nonconvex (eve...
111
click to vote
WDAG
2000
Springer
15 years 6 months ago
2000
Springer
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
119
click to vote
STOC
1995
ACM
15 years 6 months ago
1995
ACM
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...