2446 search results - page 96 / 490 » Choiceless Polynomial Time |
112
click to vote
ADAEUROPE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In this paper we present algorithms to statically detect livelocks in Ada multitasking programs. Although the algorithms’ worst-case execution time is exponential, they...
134
Voted
RTAS
2006
IEEE
15 years 6 months ago
2006
IEEE
The heterogeneous multiprocessor task partitioning with replication problem involves determining a mapping of recurring tasks upon a set consisting of different processing units i...
73
Voted
FFA
2010
14 years 10 months ago
2010
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...
106
Voted
JSC
2007
15 years 17 days ago
2007
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
111
Voted
ANTS
2008
Springer
15 years 2 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 < ...