Journal of Symbolic Computation, Volume 29, 2000 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Journal of Symbolic Computation

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 29, Number 1, January 2000

• 
  • 
  • 
  • 
  • 
    Bob F. Caviness:
    Editorial. 1
• 
  • 
  • 
  • 
  • 
    Hoon Hong:
    Editorial. 3-4
• 
  • 
  • 
  • 
  • 
    Ronald Brown, Anne Heyworth:
    Using Rewriting Systems to Compute Left Kan Extensions and Induced Actions of Categories. 5-31
• 
  • 
  • 
  • 
  • 
    Sergey Bratus, Igor Pak:
    Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture. 33-57
• 
  • 
  • 
  • 
  • 
    Sarah Rees, Leonard H. Soicher:
    An Algorithmic Approach to Fundamental Groups and Covers of Combinatorial Cell Complexes. 59-77
• 
  • 
  • 
  • 
  • 
    David A. Wolfram:
    A Formula for the General Solution of a Constant-coefficient Difference Equation. 79-82
• 
  • 
  • 
  • 
  • 
    Vincent Prosper:
    SFA, a Package on Symmetric Functions Considered as Operators over the Ring of Polynomials for the Computer Algebra System Maple. 83-94
• 
  • 
  • 
  • 
  • 
    John Carminati, Khai Vu:
    Symbolic Computation and Differential Equations: Lie Symmetries. 95-116

Volume 29, Number 2, February 2000

Advances in First-order Theorem Proving

• 
  • 
  • 
  • 
  • 
    Chandrabose Aravindan, Peter Baumgartner:
    Theorem Proving Techniques for View Deletion in Databases. 119-147
• 
  • 
  • 
  • 
  • 
    Matthias Baaz, Alexander Leitsch:
    Cut-elimination and Redundancy-elimination by Resolution. 149-177
• 
  • 
  • 
  • 
  • 
    Ricardo Caferra, Nicolas Peltier:
    Combining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models. 177-211
• 
  • 
  • 
  • 
  • 
    Reinhard Pichler:
    Speeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria. 213-257
• 
  • 
  • 
  • 
  • 
    Andrea Formisano, Eugenio G. Omodeo, Marco Temperini:
    Goals and Benchmarks for Automated Map Reasoning. 259-297
• 
  • 
  • 
  • 
  • 
    Marc Fuchs:
    Controlled Use of Clausal Lemmas in Connection Tableau Calculi. 299-341
• 
  • 
  • 
  • 
  • 
    Pedro J. Martín, Antonio Gavilanes, Javier Leach:
    Tableau Methods for a Logic with Term Declarations. 343-372
• 
  • 
  • 
  • 
  • 
    Uwe Petermann:
    Connection Calculus Theorem Proving with Multiple Built-in Theories. 373-392

Volume 29, Number 3, March 2000

• 
  • 
  • 
  • 
  • 
    Guoting Chen, Jean Della Dora:
    An Algorithm for Computing a New Normal Form for Dynamical Systems. 393-418
• 
  • 
  • 
  • 
  • 
    David A. Cox, Ronald N. Goldman, Ming Zhang:
    On the Validity of Implicitization by Moving Quadrics for Rational Surfaces with No Base Points. 419-440
• 
  • 
  • 
  • 
  • 
    Wayne Eberly, Mark Giesbrecht:
    Efficient Decomposition of Associative Algebras over Finite Fields. 441-458
• 
  • 
  • 
  • 
  • 
    Graziano Gentili, Michael A. O'Connor:
    On Rational Geometry of Conic Sections. 459-470
• 
  • 
  • 
  • 
  • 
    Adam W. Strzebonski:
    Solving Systems of Strict Polynomial Inequalities. 471-480

Volume 29, Numbers 4-5, May 2000

Symbolic Computation in Algebra, Analysis, and Geometry

• 
  • 
  • 
  • 
  • 
    Eduardo Cattani, Reinhard C. Laubenbacher:
    Special Issue on Symbolic Computation in Algebra, Analysis, and Geometry - Foreword of the Guest Editors. 483
• 
  • 
  • 
  • 
  • 
    Irina Berchenko, Peter J. Olver:
    Symmetries of Polynomials. 485-514
• 
  • 
  • 
  • 
  • 
    Laurent Busé, Mohamed Elkadi, Bernard Mourrain:
    Generalized Resultants over Unirational Algebraic Varieties. 515-526
• 
  • 
  • 
  • 
  • 
    Marc Chardin:
    Applications of Some Properties of the Canonical Module in Computational Projective Algebraic Geometry. 527-544
• 
  • 
  • 
  • 
  • 
    Wolfram Decker, Frank-Olaf Schreyer:
    Non-general Type Surfaces in P4: Some Remarks on Bounds and Constructions. 545-582
• 
  • 
  • 
  • 
  • 
    David Eisenbud, Mircea Mustala, Michael Eugene Stillman:
    Cohomology on Toric Varieties and Local Cohomology with Monomial Supports. 583-600
• 
  • 
  • 
  • 
  • 
    Edward L. Green:
    Multiplicative Bases, Gröbner Bases, and Right Gröbner Bases. 601-623
• 
  • 
  • 
  • 
  • 
    Serkan Hosten, Jay Shapiro:
    Primary Decomposition of Lattice Basis Ideals. 625-639
• 
  • 
  • 
  • 
  • 
    Evelyne Hubert:
    Factorization-free Decomposition Algorithms in Differential Algebra. 641-662
• 
  • 
  • 
  • 
  • 
    Henri Lombardi, Marie-Françoise Roy, Mohab Safey El Din:
    New Structure Theorem for Subresultants. 663-689
• 
  • 
  • 
  • 
  • 
    Ezra Miller, Bernd Sturmfels, Kohji Yanagawa:
    Generic and Cogeneric Monomial Ideals. 691-708
• 
  • 
  • 
  • 
  • 
    Mircea Mustala:
    Local Cohomology at Monomial Ideals. 709-720
• 
  • 
  • 
  • 
  • 
    Toshinori Oaku, Nobuki Takayama, Uli Walther:
    A Localization Algorithm for D-modules. 721-728
• 
  • 
  • 
  • 
  • 
    Gregory G. Smith:
    Computing Global Extension Modules. 729-746
• 
  • 
  • 
  • 
  • 
    Harrison Tsai:
    Weyl Closure of a Linear Differential Operator. 747-775
• 
  • 
  • 
  • 
  • 
    Jan Verschelde:
    Toric Newton Method for Polynomial Homotopies. 777-793
• 
  • 
  • 
  • 
  • 
    Uli Walther:
    Algorithmic Computation of de Rham Cohomology of Complements of Complex Affine Varieties. 795-839

Volume 29, Number 6, June 2000

• 
  • 
  • 
  • 
  • 
    Manuel Bronstein:
    On Solutions of Linear Ordinary Difference Equations in their Coefficient Field. 841-877
• 
  • 
  • 
  • 
  • 
    Shuhong Gao, Joachim von zur Gathen, Daniel Panario, Victor Shoup:
    Algorithms for Exponentiation in Finite Fields. 879-889
• 
  • 
  • 
  • 
  • 
    Erich L. Kaltofen:
    Challenges of Symbolic Computation: My Favorite Open Problems. 891-919
• 
  • 
  • 
  • 
  • 
    Ursula Martin, Duncan Shand:
    Invariants, Patterns and Weights for Ordering Terms. 921-957
• 
  • 
  • 
  • 
  • 
    Stefan Maubach:
    An Algorithm to Compute the Kernel of a Derivation up to a Certain Degree. 959-970
• 
  • 
  • 
  • 
  • 
    Petru Pau, Josef Schicho:
    Quantifier Elimination for Trigonometric Polynomials by Cylindrical Trigonometric Decomposition. 971-983

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: