Effective Methods in Algebraic Geometry
The symposium "MEGA-90 - Effective Methods in Algebraic Geome try" was held in Castiglioncello (Livorno, Italy) in April 17-211990. The themes - we quote from the "Call for papers" - were the fol lowing: - Effective methods and complexity issues in commutative algebra, pro jec...
Main Authors: | , |
---|---|
Format: | eBook |
Language: | English |
Published: |
Boston, MA
Birkhäuser
1991, 1991
|
Edition: | 1st ed. 1991 |
Series: | Progress in Mathematics
|
Subjects: | |
Online Access: | |
Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- A Single Exponential Bound on the Complexity of Computing Gröbner Bases of Zero Dimensional Ideals
- Algorithms for a Multiple Algebraic Extension
- Elementary constructive theory of ordered fields
- Effective real Nullstellensatz and variants
- Algorithms for the Solution of Systems of Linear Equations in Commutative Rings
- Une conjecture sur les anneaux de Chow A(G, ?) renforcée par un calcul formel
- Construction de courbes de genre 2 à partir de leurs modules
- Computing Syzygies à la Gau?-Jordan
- The non-scalar Model of Complexity in Computational Geometry
- Géométrie et Interpretations Génériques, un Algorithme
- Canonical Bases: Relations with Standard Bases, Finiteness Conditions and Application to Tame Automorphisms
- The tangent cone algorithm and some applications to local algebraic geometry
- Effective Methods for Systems ofAlgebraic Partial Differential Equations
- On Lack of Effectiveness in Semi-algebraic Geometry
- A simple constructive proof of Canonical Resolution of Singularities
- Local Membership Problems for Polynomial Ideals
- Un Algorithme pour le Calcul des Résultants
- On algorithms for real algebraic plane curves
- Duality methods for the membership problem
- Exemples d’ensembles de Points en Position Uniforme
- Efficient Algorithms and Bounds for Wu-Ritt Characteristic Sets
- Noetherian Properties and Growth of some Associative Algebras
- Codes and Elliptic Curves
- Algorithmes – disons rapides – pour la décomposition d’une variété algébrique en composantes irréductibles et équidimensionnelles
- Complexity of Solving Systems of Linear Equations over the Rings of Differential Operators
- Membership problem, Representation problem and the Computation of the Radical for one-dimensional Ideals
- On the Complexity of Zero-dimensional Algebraic Systems
- Finding roots of equations involving functions defined by first order algebraic differential equations
- Some Effective Methods in the Openness of Loci for Cohen-Macaulay and Gorenstein Properties
- Sign determination on zero dimensional sets
- A Classification of Finite-dimensional Monomial Algebras
- An algorithm related to compactifications of adjoint groups
- Deciding Consistency of Systems of Polynomial in Exponent Inequalities in Subexponential Time