


default search action
ACM SIGSAM Bulletin, Volume 8
Volume 8, Number 1, February 1974
- J. Denbigh Starkey:

A solution to Kiang's problem #6. 2-3 - Stephen C. Johnson, Ronald L. Graham:

Problem #7. 4 - J. A. van Hulzen:

FORMAC today, or what can happen to an orphan. 5-7 - David Barton, John P. Fitch:

Algebraic manipulation in Cambridge. 8-9 - Knut A. Bahr:

Toward a revision of FORMAC. 10-16
Volume 8, Number 2, May 1974
- Arthur D. Hall III, Stephen C. Johnson:

ALTRAN programs for SIGSAM problem #6. 12-36 - Richard J. Fateman, Joel Moses, Paul Wang:

Solution to problem #7 using MACSYMA. 14-16 - George E. Collins, David R. Musser, Michael Rothstein:

SAC-1 solution of problem #7. 17-19 - Richard D. Jenks:

The SCRATCHPAD language. 20-30 - Jaap Smit:

Introduction to NETFORM. 31-36
Volume 8, Number 3, August 1974
- Yngve Sundblad:

Symbolic mathematical systems now and in the future. 1-8 - Rüdiger G. K. Loos:

Toward a formal implementation of computer algebra. 9-16 - Knut Bahr, Jaap Smit:

Tuning an algebraic manipulation system through measurements. 17-23 - Nisse Husberg, Jouko J. Seppänen:

ANALITIK: principal features of the language and its implementation. 24-25 - W. S. Brown:

On computing with factored rational expressions. 26-34 - Andrew D. Hall Jr.:

Factored rational expressions in ALTRAN. 35-45 - Alfonso Miola, David Y. Y. Yun:

Computational aspects of Hensel-type univariate polynomial greatest common divisor algorithms. 46-54 - H. Strubbe:

Presentation of the SCHOONSCHIP system. 55-60 - W. Morven Gentleman:

Experience with truncated power series. 61-62 - Stephen C. Johnson:

Sparse polynomial arithmetic. 63-71 - Dorothea A. Klip:

Different polynomial representations and their interaction in the portable algebra system PORT-ALG. 72-73 - Jacques Calmet:

Computer recognition of divergences in Feynman diagrams. 74-75 - Inge Frick:

A non-numerical computation involving sums of many products of finite rotation matrices for spin 3/2. 76-77 - H. Ian Cohen:

A perturbation calculation in general relativity. 78-79 - George E. Collins:

Quantifier elimination for real closed fields by cylindrical algebraic decomposition-preliminary report. 80-90 - Dennis Weeks:

Formal representations for algebraic numbers. 91-95 - Pierre Verbaeten:

The automatic construction of pure recurrence relations. 96-98 - Edward W. Ng:

Symbolic integration of a class of algebraic functions. 99-102 - Alfonso Miola:

The use of symbolic computation in solving free boundary problems by the Ritz-Galerkin method. 103-104 - Joel Moses:

MACSYMA - the fifth year. 105-110
Volume 8, Number 4, November 1974
- John P. Fitch:

Problem #8: random walk. 11 - James H. Griesmer, Richard D. Jenks:

A solution to problem #4: the lie transform. 12-13 - John P. Fitch:

A solution of problem #3 using CAMAL. 14-25 - John P. Fitch:

A simple method of taking nth roots of integers. 26 - David Y. Y. Yun:

A p-adic division with remainder algorithm. 27-32

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














