43 search results - page 1 / 9 » Generic Polynomials with Few Parameters |
JSC
2000
13 years 4 months ago
2000
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...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
AB
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. Symbolic methods for investigating Hopf bifurcation problems of vector fields arising in the context of algebraic biology have recently obtained renewed attention. Howev...
SIGSOFT
2007
ACM
14 years 5 months ago
2007
ACM
A compiler-checked immutability guarantee provides useful documentation, facilitates reasoning, and enables optimizations. This paper presents Immutability Generic Java (IGJ), a n...