534 search results - page 7 / 107 » Efficient polynomial L-approximations |
ISSAC
1995
Springer
13 years 11 months ago
1995
Springer
We present an efficient algorithm for testing whether a given integral polynomial has two distinct roots a, B such that fflp is a root of unity. The test is based on results obtai...
IPL
2010
13 years 5 months ago
2010
Polynomial algorithms are given for the following two problems:
CORR
2008
Springer
13 years 7 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...
ASAP
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...