Journal of Symbolic Computation
, Volume 4, 1987
Volume 4, Number 1, August 1987
R. Böffgen
,
M. A. Reichert
: Computing the Decomposition of Primes p and p-adic Absolute Values in Semi-simple Algebras over Q. 3-10
Johannes Buchmann
,
Hugh C. Williams
: On Principal Ideal Testing in Algebraic Number Fields. 11-19
L. Cerlienco
,
Maurice Mignotte
,
F. Piras
: Computing the Measure of a Polynomial. 21-33
Harvey Cohn
,
Jesse Ira Deutsch
: Application of Symbolic Manipulation to the Hecke Transformations of Modular Forms in Two Variables, II. 35-40
Carsten Eckhardt
: Computation of Class Numbers by an Analytic Method. 41-52
H. G. Folz
,
Horst Günter Zimmer
: What is the Rank of the Demjanenko Matrix? 53-67
David J. Ford
: The Construction of Maximal Orders Over a Dedekind Domain. 69-75
Erich Kaltofen
: Deterministic Irreducibility Testing of Polynomials over Large Finite Fields. 77-82
Gunter Malle
: Polynomials for Primitive Nonsolvable Permutation Groups of Degree d \leq 15. 83-92
B. Heinrich Matzat
,
Andreas Zeh-Marschke
: Polynome mit der Galoisgruppe M_11 über Q. 93-97
Eckart Maus
: Computation of Integral Bases in Certain S_n Extensions of Q. 99-102
Attila Pethö
: On the Resolution of Thue Inequalities. 103-109
W. Plesken
: Towards a Soluble Quotient Algorithm. 111-122
Michael Pohst
: A Modification of the LLL Reduction Algorithm. 123-127
Volume 4, Number 2, October 1987
Joachim von zur Gathen
: Feasible Arithmetic Computations: Valiant's Hypothesis. 137-172
Neil V. Murray
,
Erik Rosenthal
: Theory Links: Applications to Automated Theorem Proving. 173-190
Wolfram Büttner
,
Helmut Simonis
: Embedding Boolean Expressions into Logic Programming. 191-205
Robert Paige
,
Fritz Henglein
: Mechanical Translation of Set Theoretic Problem Specifications into Efficient RAM Code-A Case Study. 207-232
Jean H. Gallier
: Fast Algorithms for Testing Unsatisfiability of Ground Horn Clauses with Equations. 233-254
Gordon F. Royle
: The Transitive Groups of Degree Twelve. 255-268
Volume 4, Number 3, December 1987
Jacek Gibert
: Functional Programming with Combinators. 269-293
Stéphane Kaplan
: Simplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence. 295-334
Aziz Hilali
: On the Algebraic and Differential Newton-Puiseux Polygons. 335-349
Sabine Stifter
: A Generalization of Reduction Rings. 351-364
Douglas A. Young
,
Paul S. Wang
: GI/S: A Graphical User Interface For Symbolic Computation Systems. 365-380
W. A. Beyer
,
L. R. Fawcett
,
R. Daniel Mauldin
,
B. K. Swartz
: The Volume Common to Two Congruent Circular Cones whose Axes Intersect Symmetrically. 381-390
Isaac Elishakoff
: Application of Symbolic Algebra to the Instability of a Nonconservative System. 391-396
S. Bandyopadhyay
,
John S. Devitt
: SIS - A Symbolic Information Management System. 397-408
Copyright ©
Fri Nov 27 19:55:14 2009 by
Michael Ley
(
ley@uni-trier.de
)