Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

ISSAC

Known as: EUROCAL, SYMSAC 
ISSAC, the International Symposium on Symbolic and Algebraic Computation, is an academic conference in the field of computer algebra. ISSAC has been… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
Part I. Helpful Preliminaries: 1. MATLAB(R) as a computational tool 2. Mathematical preliminaries Part II. Using Optimization… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.5
  • figure 1.6
2014
2014
Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier… Expand
  • table 1
  • table 2
  • table 3
  • table 4
2013
2013
A new efficient algorithm for computing a comprehensive Grobnersystem of a parametric polynomial ideal over k[U][X] is presented… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
Highly Cited
2010
Highly Cited
2010
Hybrid Communicating Sequential Processes (HCSP) is an extension of CSP allowing continuous dynamics. We are interested in… Expand
2008
2008
The discovery of invariants and ranking functions plays a central role in program verification. In our previous work, we… Expand
2007
2007
In order to compute an eliminate portion of a given polynomial ideal by a Grobner basis computation, we usually need to compute a… Expand
Highly Cited
2003
Highly Cited
2003
  • E. Arnold
  • J. Symb. Comput.
  • 2003
  • Corpus ID: 14850313
Intermediate coefficient swell is a well-known difficulty with Buchberger's algorithm for computing Grobner bases over the… Expand
Highly Cited
1996
Highly Cited
1996
  • J. R. Harrison
  • CPHC/BCS distinguished dissertations
  • 1996
  • Corpus ID: 38754316
The Distinguished Dissertation series is published on behalf of the Conference of Professors and Heads of Computing and the… Expand
Highly Cited
1991
Highly Cited
1991
  • bitnetJoos Heintz
  • 1991
  • Corpus ID: 259865
We show that the dimension of an algebraic (a ne or projective) variety can be computed by a well parallelizable arithmetical… Expand
Highly Cited
1989
Highly Cited
1989
Abstract Inductionless induction consists of using pure equational reasoning for proving the validity of an equation in the… Expand