Examples of using dynamic constructible closure

Teresa Gómez-Díaz

Mathematics and Computers in Simulation (MATCOM), 1996, vol. 42, issue 4, 375-383

Abstract: We present here some examples of using the “Dynamic Constructible Closure” program, which performs automatic case distinction in computations involving parameters over a base field K. This program is an application of the “Dynamic Evaluation” principle, which generalizes traditional evaluation and was first used to deal with algebraic numbers.

Keywords: Dynamic evaluation; Parameters; Computer algebra; Polynomial systems; Automatic theorem proving (search for similar items in EconPapers)
Date: 1996
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475496800015
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:42:y:1996:i:4:p:375-383

DOI: 10.1016/S0378-4754(96)80001-5

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().