A case study in interlanguage communication: Fast LISP polynomial operations written in 'C'

Authors:
Richard J. Fateman
Affiliations:
-
Venue:
SYMSAC '81 Proceedings of the fourth ACM symposium on Symbolic and algebraic computation
Year:
1981

Citing 3
Cited 3

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Probabilistic algorithms for sparse polynomials

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Practical fast polynomial multiplication

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation

A fast, low-space algorithm for multiplying dense multivariate polynomials

ACM Transactions on Mathematical Software (TOMS)
Fast reduce: the trade-off between efficiency and generality

ACM SIGSAM Bulletin
What do we want from a high-level language?

ACM SIGSAM Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is shown that a simple program, written in the “C” programming language, can be interfaced to a Lisp algebraic manipulation system with substantial performance improvement as a result.