900 search results - page 8 / 180 » On Polynomial Time Computation over Unordered Structures |
ISSAC
2007
Springer
14 years 2 months ago
2007
Springer
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
SAGT
2010
Springer
13 years 7 months ago
2010
Springer
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
BMVC
2001
13 years 11 months ago
2001
A method to correspond linear structures in mammographic images is presented. Our approach is based on automatically establishing correspondence between linear structures which ap...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...