AbstractThis paper is devoted to a precise algorithmical and complexity study of a new polynomial time method for formal computations with polynomial inequalities and real algebraic numbers
International audienceLet f= (f1, ..., fs) be a sequence of polynomials in Q[X1,...,Xn] of maximal d...
AbstractThis paper is concerned with exact real solving of well-constrained, bivariate polynomial sy...
AbstractThis paper explains how computer algebra (Reduce) was used to analyse the expressions result...
AbstractThis paper is devoted to a precise algorithmical and complexity study of a new polynomial ti...
© 2018, Springer International Publishing AG, part of Springer Nature. Using an extension of the not...
This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bo...
This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bo...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Abstract. Real algebraic numbers are the real numbers that are real roots of univariate polynomials ...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
AbstractThis paper presents a new encoding scheme for real algebraic number manipulations which enha...
We briefly survey recent computational complexity results for certain algebraic problems that are re...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
International audienceLet f= (f1, ..., fs) be a sequence of polynomials in Q[X1,...,Xn] of maximal d...
AbstractThis paper is concerned with exact real solving of well-constrained, bivariate polynomial sy...
AbstractThis paper explains how computer algebra (Reduce) was used to analyse the expressions result...
AbstractThis paper is devoted to a precise algorithmical and complexity study of a new polynomial ti...
© 2018, Springer International Publishing AG, part of Springer Nature. Using an extension of the not...
This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bo...
This paper gives a description of some aspects of complexity in real algebraic geometry: explicit bo...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Abstract. Real algebraic numbers are the real numbers that are real roots of univariate polynomials ...
AbstractBy modifying and combining algorithms in symbolic and numerical computation, we propose a re...
AbstractThis paper presents a new encoding scheme for real algebraic number manipulations which enha...
We briefly survey recent computational complexity results for certain algebraic problems that are re...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
Computational Complexity is concerned with the resources that are required for algorithms to detect ...
International audienceLet f= (f1, ..., fs) be a sequence of polynomials in Q[X1,...,Xn] of maximal d...
AbstractThis paper is concerned with exact real solving of well-constrained, bivariate polynomial sy...
AbstractThis paper explains how computer algebra (Reduce) was used to analyse the expressions result...
DOI
Add to ORKG