Symbolic and Algebraic Computation
Computer algebra systems, polynomial system solving, and quantifier elimination.
Symbolic and Algebraic Computation. Computer algebra systems, polynomial system solving, and quantifier elimination.
Foundations and canonical references
The standard treatments of symbolic and algebraic computation approach the subject from complementary angles. Vongathen, Modern Computer Algebra (2013) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Petkovsek, A=B (1996) gives a parallel, more proof-oriented exposition of the same material and is widely used as a graduate text.
Open methodological questions for symbolic and algebraic computation include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 2013Modern Computer Algebravongathen-2013, gerhard-2013
- textbook · primary · 1996A=Bpetkovsek-1996, wilf-1996, zeilberger-1996
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.