default search action
Journal of Symbolic Computation, Volume 13, 1992
Volume 13, Number 1, January 1992
- Jean-Louis Lassez, Ken McAloon:
A Canonical Form for Generalized Linear Constraints. 1-24 - J. Rafael Sendra, Juan Llovet:
An Extended Polynomial GCD Algorithm Using Hankel Matrices. 25-40 - Susan Landau:
A Note on "Zippel Denesting". 41-46 - Michael B. Monagan:
A Heuristic Irreducibility Test for Univariate Polynomials. 47-58 - R. D. Mills:
Slope Retention Techniques for Solving Boundary-Value Problems in Differential Equations. 59-80 - Ursula Martin, Michael Lai:
Some Experiments with a Completion Theorem Prover. 81-100 - Robert G. Cowell:
Application of Ordered Standard Bases to Catastrophe Theory. 101-115
Volume 13, Number 2, Februarg 1992
- Daniel Lazard:
Solving Zero-Dimensional Algebraic Systems. 117-132 - Patrick Fitzpatrick, J. Flynn:
A Gröbner Basis Technique for Inverting Mulitvariable Hensel Codes. 133-138 - Nicolai N. Vorobjov Jr.:
The Complexity of Deciding Consistency of Systems of Polynomial in Exponent Inequalities. 139-174 - Stanley Burris:
Discriminator Varieties and Symbolic Computation. 175-208 - Matthew Dickerson:
The Inverse of an Automorphism in Polynomial Time. 209-220 - W. A. Beyer, L. R. Fawcett, Leo P. Harten, Blair K. Swartz:
The Volume Common to Two Congruent Cylinders. 221-230
Volume 13, Number 3, March 1992
- Daniel Lazard:
A Note on Upper Bounds for Ideal-Theoretic Problems. 231-234 - Peter W. O'Hearn, Zbigniew Stachniak:
Resolution Framework for Finitely-Valued First-Order Logics. 235-254 - James Renegar:
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals. 255-300 - James Renegar:
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II: The General Decision Problem. Preliminaries for Quantifier Elimination. 301-328 - James Renegar:
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination. 329-352
Volume 13, Number 4, April 1992
- William Y. Sit:
An Algorithm for Solving Parametric Linear Systems. 353-394 - Tateaki Sasaki, Masayuki Suzuki:
Three New Algorithms for Multivariate Polynomial GCD. 395-412 - Manuel Bronstein:
On Solutions of Linear Ordinary Differential Equations in their Coefficient Field. 413-440 - Jochen Dörre, William C. Rounds:
On Subsumption and Semiunifaction in Feature Algebras. 441-461
Volume 13, Number 5, May 1992
- Bernard Beauzamy:
Products of Polynomials and a Priori Estimates for Coefficients in Polynomial Decompositions: A Sharp Result. 463-472 - William W. Adams, A. K. Boyle:
Some Comments on Gröbner Bases over Commutative Rings. 473-484 - John F. Canny, Dinesh Manocha:
Implicit Representation of Rational Parametric Surfaces. 485-510 - Robert L. Grossman, Richard G. Larson:
Symbolic Computation of Derivations Using Labeled Trees. 511-524 - Paul H. Knowles:
Integration of a Class of Transcendental Liouvillian Functions with Error-Functions, Part I. 525-544 - Richard J. Fateman:
A Review of Mathematica. 545-579
Volume 13, Number 6, June 1992
- Wolfram Koepf:
Power Series in Computer Algebra. 581-604 - Maurice Mignotte:
On the Product of the Largest Roots of a Polynomial. 605-612 - Ricardo Caferra, Nicolas Zabel:
A Method for Simultanous Search for Refutations and Models by Equational Constraint Solving. 613-642 - J. E. F. Guimaraes, Glenn R. Heppler, Stephen R. Czapor:
On the Derivation and Reduction of C1 Trigonometric Basis Functions Using MapleTM. 643-676 - Yeow Meng Chee:
On Graphical Quintuple Systems. 677-682 - W. Sarlet, J. Vanden Bonne:
REDUCE-Procedures for the Study of Adjoint Symmetries of Second-Order Differential Equations. 683-693
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.