


default search action
Journal of Symbolic Computation, Volume 18, 1994
Volume 18, Number 1, July 1994
- Hilary A. Priestley, Martin P. Ward

:
A Multipurpose Backtracking Algorithm. 1-40 - Pierangelo Miglioli, Ugo Moscato

, Mario Ornaghi:
Abstract Parametric Classes and Abstract Data Types defined by Classical and Constructive Logical Methods. 41-81 - Ivo Düntsch

:
A Microcomputer Based System for Small Relation Algebras. 83-86 - Craig R. Orr, Doron Zeilberger:

A Computer Algebra Approach to the Discrete Dirichlet Problem. 87-90
Volume 18, Number 2, August 1994
- Robert Cremanns, Friedrich Otto:

Finite Derivation Type Implies the Homological Finiteness Condition FP_3. 91-112 - Hélène Kirchner, Christophe Ringeissen:

Combining Symbolic Constraint Solvers on Algebraic Domains. 113-155 - Susumu Yamasaki

, Kentaro Iida:
Transformation of Logic Programs to FP Programs Based on Dataflows. 157-182
Volume 18, Number 3, September 1994
- Victor Y. Pan:

Simple Multivariate Polynomial Multiplication. 183-186 - Xiangdong Wang:

The Hecke Operators on S_k(Gamma_1 (N)). 187-198 - Klaus Meer:

Real Number Computations: On the Use of Information. 199-206 - Hiroyuki Sawada

, Satoshi Terasaki, Akira Aiba:
Parallel Computation of Gröbner Bases on Distributed Memory Machines. 207-222 - Toshinori Oaku, Takeshi Shimoyama:

A Gröbner Basis Method for Modules over Rings of Differential Operators. 223-248 - Dongming Wang:

Differentiation and Integration of Indefinite Summations with Respect to Indexed Variables - Some Rules and Applications. 249-263 - Mark Sofroniou:

Symbolic Derivation of Runge-Kutta Methods. 265-296
Volume 18, Number 4, October 1994
- Denis Lugiez, J. L. Moysset:

Tree Automata Help One To Solve Equational Formulae In AC-Theories. 297-318 - Irène Durand:

Bounded, Strongly Sequential and Forward-Branching Term Rewriting Systems. 319-352 - Mark van Hoeij:

An Algorithm for Computing an Integral Basis in an Algebraic Function Field. 353-363 - Michael Kalkbrener:

Prime Decompositions of Radicals in Polynomial Rings. 365-372 - Freyja Hreinsdóttir:

A Case Where Choosing a Product Order Makes the Calculations of a Groebner Basis Much Faster. 373-378 - Maurice Mignotte, Philippe H. Glesser:

Landau's Inequality via Hadamard's. 379-383 - Felix Ulmer:

Irreducible Linear Differential Equations of Prime Order. 385-401
Volume 18, Number 5, November 1994
- Osami Yamamoto:

On Some Bounds for Zeros of Norm-Bounded Polynomials. 403-427 - Dominique Duval:

Algebraic Numbers: An Example of Dynamic Evaluation. 429-445 - Abdallah Assi:

On Flatness of Generic Projections. 447-462 - Andreas Weiermann:

Complexity Bounds for Some Finite Forms of Kruskal's Theorem. 463-488 - Krzysztof R. Apt, Peter van Emde Boas, Angelo Welling:

The STO-Problem is NP-Hard. 489-495
Volume 18, Number 6, December 1994
- Boo Barkee, Deh Cac Can, Julia Ecks, Theo Moriarty, R. F. Ree:

Why You Cannot Even Hope to use Gröbner Bases in Public Key Cryptography: An Open Letter to a Scientist Who Failed and a Challenge to Those Who Have Not Yet Failed. 497-501 - Yonhao Ma:

On The Minors Defined By A Generic Matrix. 503-518 - Ming-Deh A. Huang, Doug Ierardi:

Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve. 519-539 - Alice C. Niemeyer

:
A Finite Soluble Quotient Algorithm. 541-561 - John Pedersen, Margaret Yoder:

Term Rewriting for the Conjugacy Problem and the Braid Groups. 563-572 - Luca Gemignani

:
Solving Hankel Systems over the Integers. 573-584 - Eric Bach:

Tensor Products and Computability. 585-593

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














