10608 search results - page 398 / 2122 » Complexity of O'Hara's Algorithm |
140
click to vote
CAV
2007
Springer
15 years 8 months ago
2007
Springer
We present a simple and effective approximated backward reachability algorithm for parameterized systems with existentially and universally quantified global conditions. The indivi...
141
click to vote
ANTS
2008
Springer
15 years 6 months ago
2008
Springer
We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
128
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
126
click to vote
GRAPHITE
2004
ACM
15 years 9 months ago
2004
ACM
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
141
click to vote
SPIN
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. In this paper we propose a distributed algorithm for modelchecking LTL. In particular, we explore the possibility of performing nested depth-first search algorithm in di...