Sciweavers

DM
2006
78views more  DM 2006»
13 years 5 months ago
On polynomial digraphs
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
Josep M. Brunat, Antonio Montes
CORR
2006
Springer
93views Education» more  CORR 2006»
13 years 5 months ago
Fast and Simple Methods For Computing Control Points
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
Jean H. Gallier, Weqing Gu
CORR
2006
Springer
163views Education» more  CORR 2006»
13 years 5 months ago
Finding roots of polynomials over finite fields
In this paper we propose an improved algorithm for finding roots of polynomials over finite fields. This makes possible significant speed up of the decoding process of BCH, Reed-S...
Sergei V. Fedorenko, Peter Vladimirovich Trifonov
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 5 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
CORR
2006
Springer
117views Education» more  CORR 2006»
13 years 5 months ago
Explicit factors of some iterated resultants and discriminants
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
Laurent Busé, Bernard Mourrain
FOCM
2008
76views more  FOCM 2008»
13 years 5 months ago
On Smale's 17th Problem: A Probabilistic Positive Solution
Smale's 17th Problem asks "Can a zero of n complex polynomial equations in n unknowns be found approximately, on the average [for a suitable probability measure on the s...
Carlos Beltrán, Luis Miguel Pardo
FFA
2008
42views more  FFA 2008»
13 years 5 months ago
Weyl sums in Fq[x] with digital restrictions
Let Fq be a finite field and consider the polynomial ring Fq[X]. Let Q Fq[X]. A function f : Fq[X] G, where G is a group, is called strongly Q-additive, if f(AQ + B) = f(A) + f(B...
Manfred G. Madritsch, Jörg M. Thuswaldner
ENTCS
2008
102views more  ENTCS 2008»
13 years 5 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
DM
2008
83views more  DM 2008»
13 years 5 months ago
The polynomial degrees of Grassmann and Segre varieties over GF(2)
A recent proof that the Grassmannian G1;n;2 of lines of PG(n; 2) has polynomial degree n 2 1 is outlined, and is shown to yield a theorem about certain kinds of subgraphs of any (...
R. Shaw
DCG
2008
69views more  DCG 2008»
13 years 5 months ago
On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities
Let S Rk+m be a compact semi-algebraic set defined by P1 0, . . . , P 0, where Pi R[X1, . . . , Xk, Y1, . . . , Ym], and deg(Pi) 2, 1 i . Let denote the standard projection f...
Saugata Basu, Thierry Zell