900 search results - page 9 / 180 » On Polynomial Time Computation over Unordered Structures |
100
click to vote
CSL
2010
Springer
15 years 1 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 ...
122
click to vote
ANTS
2008
Springer
15 years 3 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 < ...
107
click to vote
ECCV
2000
Springer
16 years 3 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...
121
click to vote
ASAP
1995
IEEE
15 years 5 months 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
15 years 1 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...