default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Symbolic Computation, Volume 100
Volume 100, September 2020
- James H. Davenport
, Matthew England, Alberto Griggio, Thomas Sturm, Cesare Tinelli:
Symbolic computation and satisfiability checking. 1-10 - Gereon Kremer, Erika Ábrahám:
Fully incremental cylindrical algebraic decomposition. 11-37 - Matthew England, Russell J. Bradford, James H. Davenport:
Cylindrical algebraic decomposition with equational constraints. 38-71 - Christopher W. Brown, Fernando Vale-Enriquez:
From simplification to a partial theory solver for non-linear real polynomial constraints. 72-101 - Martin Bromberger, Thomas Sturm, Christoph Weidenbach:
A complete and terminating approach to linear integer solving. 102-136 - John Abbott, Anna Maria Bigatti, Elisa Palezzato, Lorenzo Robbiano:
Computing and using minimal polynomials. 137-163 - Jan Horácek, Martin Kreuzer:
On conversions from CNF to ANF. 164-186 - Curtis Bright, Ilias S. Kotsireas, Vijay Ganesh:
Applying computer algebra systems with SAT solvers to the Williamson conjecture. 187-209
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-11 21:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
