Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

2014

2014

Cylindrical algebraic decomposition(CAD) is a key tool in computational algebraic geometry, particularly for quantifier… Expand

2013

2013

A new efficient algorithm for computing a comprehensive Grobnersystem of a parametric polynomial ideal over k[U][X] is presented… Expand

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

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

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

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