Skip to search formSkip to main contentSkip to account menu

SIGSAM

SIGSAM is the ACM Special Interest Group on Symbolic and Algebraic Manipulation. It publishes the ACM Communications in Computer Algebra and often… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
In this research the Bring-Jerrard quintic polynomial equation is investigated for a formula. Firstly, an explanation given as to… 
2009
2009
For narrowing with a set of rules ∆ modulo a set of axioms B almost nothing is known about terminating narrowing strategies, and… 
2008
2008
The discovery of invariants and ranking functions plays a central role in program verification. In our previous work, we… 
2004
2004
We provide a unified view on three extensions of Process rewrite systems (PRS) and compare their and PRS's expressive power. We… 
1986
1986
In the paper, use of names like '-F&' and '*&' will imply these semantics, and furthermore, the Lucid Common Lisp compiler ought… 
1977
1977
The problem was ([Kah75]) :Let the variables a,b,c,d (which are supposed to take real values) be interpreted as the center (c,d… 
1976
1976
In this paper we present a complete algorithm for the determination of univariate power series expansions of meromorphic… 
Review
1976
Review
1976
This is the second in a series of two tutorial sessions featuring letures from the 1975-76 SIGSAM Lecture Program. Prof. Lipson's… 
1976
1976
In SIGSAM Problem # 8, [1], is asked for a part of the power series expansion of[EQUATION]The presented solution, based on… 
1975
1975
The formulation of SIGSAM problem No. 5, "Construction of high-order Runge-Kutta-Nyström formulae" is given by Campbell). We…