Sciweavers

21 search results - page 4 / 5
» jsc 2000
Sort
View
JSC
2000
60views more  JSC 2000»
13 years 7 months ago
Generic Extensions and Generic Polynomials
This paper presents a generalization of a theorem of Saltman on the existence of generic extensions with group A G over an infinite field K, where A is abelian, using less restri...
Arne Ledet
JSC
2000
117views more  JSC 2000»
13 years 7 months ago
Goals and Benchmarks for Automated Map Reasoning
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...
Andrea Formisano, Eugenio G. Omodeo, Marco Temperi...
JSC
2000
68views more  JSC 2000»
13 years 7 months ago
New Structure Theorem for Subresultants
We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and a bound o...
Henri Lombardi, Marie-Françoise Roy, Mohab ...
JSC
2007
106views more  JSC 2007»
13 years 7 months ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
JSC
2000
69views more  JSC 2000»
13 years 7 months ago
Generic Polynomials with Few Parameters
We call a polynomial g(t1, . . . , tm, X) over a field K generic for a group G if it has Galois group G as a polynomial in X, and if every Galois field extension N/L with K L and...
Gregor Kemper, Elena Mattig