900 search results - page 9 / 180 » On Polynomial Time Computation over Unordered Structures |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
ANTS
2008
Springer
13 years 10 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 < ...
ECCV
2000
Springer
14 years 10 months ago
2000
Springer
The causal estimation of three-dimensional motion from a sequence of two-dimensional images can be posed as a nonlinear filtering problem. We describe the implementation of an algo...
ASAP
1995
IEEE
14 years 4 days ago
1995
IEEE
This paper explores an architecture for parallel independent computations of inner products over the direct product ring . The structure is based on the polynomial mapping of the ...
JC
2007
13 years 8 months ago
2007
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...