default search action
Journal of Symbolic Computation, Volume 30, 2000
Volume 30, Number 1, July 2000
- Pierre Flener, Kung-Kiu Lau, Wolfgang Bibel:
Foreword to the Special Issue on Schemas. 1-3 - Penny Anderson, David A. Basin:
Program Development Schemata as Derived Rules. 5-36 - Matthias Fuchs:
Proofs as Schemas and Their Heuristic Use. 37-61 - S. M. Brien, Andrew P. Martin:
A Calculus for Schemas in Z. 63-91 - Pierre Flener, Kung-Kiu Lau, Mario Ornaghi, Julian Richardson:
An Abstract Formalization of Correct Schemas for Program Synthesis. 93-127
Volume 30, Number 2, August 2000
- Vincenzo Acciaro, Claus Fieker:
Finding Normal Integral Bases of Cyclic Number Fields of Prime Degree. 129-136 - Giovannina Albano, Francesca Cioffi, Ferruccio Orecchia, I. Ramella:
Minimally Generating Ideals of Rational Parametric Curves in Polynomial Time. 137-149 - Pedro Berrizbeitia, Thomas G. Berry:
Generalized Strong Pseudoprime Tests and Applications. 151-160 - M'hammed El Kahoui, Andreas Weber:
Deciding Hopf Bifurcations by Quantifier Elimination in a Software-component Architecture. 161-179 - István Gaál:
Solving Index Form Equations in Fields of Degree 9 with Cubic Subfields. 181-193 - Reinhard C. Laubenbacher, Irena Swanson:
Permanental Ideals. 195-205 - Thomas Sturm:
Linear Problems in Valued Fields. 207-219 - Dongming Wang:
Computing Triangular Systems and Regular Systems. 221-236
Volume 30, Number 3, September 2000
- Vincenzo Acciaro, Jürgen Klüners:
Computing Local Artin Maps, and Solvability of Norm Equations. 239-252 - Gert-Martin Greuel:
Computer Algebra and Algebraic. Geometry-Achievements and Perspectives. 253-289 - Marc Giusti, Klemens Hägele, Grégoire Lecerf, Joël Marchand, Bruno Salvy:
The Projective Noether Maple Package: Computing the Dimension of a Projective Variety. 291-307 - Ryutaroh Matsumoto, Shinji Miura:
Finding a Basis of a Linear System with Pairwise Distinct Discrete Valuations on an Algebraic Curve. 309-323 - Maurice Mignotte:
Bounds for the Roots of Lacunary Polynomials. 325-327 - Wilberd van der Kallen:
Complexity of the Havas, Majewski, Matthews LLL Hermite Normal Form Algorithm. 329-337
Volume 30, Number 4, October 2000
- Quoc-Nam Tran, Franz Winkler:
Special Issue on Applications of Gröbner Bases - Foreword of the Guest Editors. 339-340 - John Abbott, Anna Maria Bigatti, Martin Kreuzer, Lorenzo Robbiano:
Computing Ideals of Points. 341-356 - Alexander B. Levin:
Reduced Gröbner Bases, Free Difference-Differential Modules and Difference-Differential Dimension Polynomials. 357-382 - Ignacio Ojeda Martínez de Castilla, Ramón Peidra Sánchez:
Cellular Binomial Ideals. Primary Decomposition of Binomial Ideals. 383-400 - Gábor Bodnár, Josef Schicho:
Automated Resolution of Singularities for Hypersurfaces. 401-428 - Miguel A. Borges-Trenard, Mijail Borges-Quintana, Teo Mora:
Computing Gröbner Bases by FGLM Techniques in a Non-commutative Setting. 429-449 - Quoc-Nam Tran:
A Fast Algorithm for Gröbner Basis Conversion and its Applications. 451-467 - Jörn Müller-Quade, Rainer Steinwandt:
Gröbner Bases Applied to Finitely Generated Field Extensions. 469-490
Volume 30, Number 5, October 2000
- Cassiano Durand, Christoph M. Hoffmann:
A Systematic Framework for Solving Geometric Constraints Analytically. 493-519 - Aloysius G. Helminck:
Computing Orbits of Minimal Parabolic k-subgroups Acting on Symmetric k-varieties. 521-553 - Reinhard C. Laubenbacher, Karen Schlauch:
An Algorithm for the Quillen-Suslin Theorem for Quotients of Polynomial Rings by Monomial Ideals. 555-571 - Dimitrios Poulakis, Evaggelos Voskos:
On the Practical Solution of Genus Zero Diophantine Equations. 573-582 - Josef Schicho:
Proper Parametrization of Real Tubular Surfaces. 583-593 - Wolmer V. Vasconcelos:
Divisorial Extensions and the Computation of Integral Closures. 595-604 - André Weilert:
(1+i)-ary GCD Computation in Z[i] as an Analogue to the Binary GCD Algorithm. 605-617 - Thomas Wolf:
The Symbolic Integration of Exact PDEs. 619-629
Volume 30, Number 6, December 2000
- B. Heinrich Matzat, John McKay, Kazuhiro Yokoyama:
Special Issue on Algorithmic Methods in Galois Theory - Foreword of the Guest Editors. 631-633 - Philippe Aubry, Annick Valibouze:
Using Galois Ideals for Computing Relative Resolvents. 635-651 - Katharina Geissler, Jürgen Klüners:
Galois Group Computation for Rational Polynomials. 653-674 - Jürgen Klüners, Gunter Malle:
Explicit Galois Realization of Transitive Groups of Degree up to 15. 675-716 - Gunter Malle:
Multi-parameter Polynomials with Given Galois Group. 717-731 - Jürgen Klüners:
A Polynomial with Galois Group SL2(11). 733-737 - Jean Marc Couveignes:
Boundary of Hurwitz Spaces and Explicit Patching. 739-759 - Michael Dettweiler, Stefan Reiter:
An Algorithm of Katz and its Application to the Inverse Galois Problem. 761-798 - Luis Dieulefait, Nuria Vilà:
Projective Linear Groups as Galois Groups over Q via Modular Representations. 799-810 - Montserrat Vela:
Explicit Solutions of Galois Embedding Problems by Means of Generalized Clifford Algebras. 811-842 - Gregor Kemper, Elena Mattig:
Generic Polynomials with Few Parameters. 843-857 - Arne Ledet:
Generic and Explicit Realization of Small p-groups. 859-865 - Arne Ledet:
Generic Extensions and Generic Polynomials. 867-872
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.