Result 1 to 20 of 25 total
Real root isolation for exp-log-arctan functions. (English)
J. Symb. Comput. 47, No. 3, 282-314 (2012).
1
Cylindrical decomposition for systems transcendental in the first variable. (English)
J. Symb. Comput. 46, No. 11, 1284-1290 (2011).
2
Univariate real root isolation in an extension field. (English)
Comput. Res. Repos. 2011, Article No. 1101.4369 (2011).
3
Univariate real root isolation in an extension field (English)
ISSAC, 321-328 (2011).
4
Computation with semialgebraic sets represented by cylindrical algebraic formulas (English)
ISSAC, 61-68 (2010).
5
Black-box/white-box simplification and applications to quantifier elimination (English)
ISSAC, 69-76 (2010).
6
Real root isolation for tame elementary functions. (English)
May, John P. (ed.), ISSAC 2009. Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, Seoul, July 28‒31, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-609-0). 341-350 (2009).
7
Real root isolation for tame elementary functions (English)
ISSAC, 341-350 (2009).
8
FLQ, the fastest quadratic complexity bound on the values of positive roots of polynomials. (English)
Serdica J. Comput. 2, No. 2, 145-162 (2008).
9
Real root isolation for exp-log functions. (English)
Jeffrey, David J. (ed.), ISSAC 2008. Proceedings of the twenty-first international symposium on symbolic and algebraic computation 2008, Linz/Hagenberg, Austria, July 20‒23, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-904-3). 303-314 (2008).
10
On the various bisection methods derived from Vincent’s theorem. (English)
Serdica J. Comput. 2, No. 1, 89-104 (2008).
11
Real root isolation for exp-\log functions (English)
ISSAC, 303-314 (2008).
12
Advances on the continued fractions method using better estimations of positive root bounds. (English)
Ganzha, Victor G. (ed.) et al., Computer algebra in scientific computing. 10th international workshop, CASC 2007, Bonn, Germany, September 16‒20, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75186-1/pbk). Lecture Notes in Computer Science 4770, 24-30 (2007).
13
Frobenius numbers by lattice point enumeration. (English)
Integers 7, No. 1, Paper A15, 63 p., electronic only (2007).
14
Advances on the continued fractions method using better estimations of positive root bounds (English)
CASC, 24-30 (2007).
15
Cylindrical algebraic decomposition using validated numerics. (English)
J. Symb. Comput. 41, No. 9, 1021-1038 (2006).
16
Implementations of a new theorem for computing bounds for positive roots of polynomials. (English)
Computing 78, No. 4, 355-367 (2006).
17
Applications of algorithms for solving equations and inequalities in Mathematica (English)
Algorithmic Algebra and Logic, 243-247 (2005).
18
Solving systems of strict polynomial inequalities. (English)
J. Symb. Comput. 29, No.3, 471-480 (2000).
19
A real polynomial decision algorithm using arbitrary-precision floating point arithmetic. (English)
Csendes, Tibor (ed.), Developments in reliable computing. SCAN-98 conference, 8th international symposium on Scientific computing, computer arithmetic and validated numerics. Budapest, Hungary, September 22‒25, 1998. Dordrecht: Kluwer Academic Publishers (ISBN 0-7923-6057-5). 337-346 (1999).
20
Result 1 to 20 of 25 total
Start
Contact
Print
General Help
