Add to ORKGWe propose an algorithm for isolating the real solutions of semi-algebraic systems, which has been implemented as a Maple-program realzero. The performance of realzero in solving some examples from various applications is presented and the timings are reported
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
This paper discusses the implementation of a reduction algorithm for differential-algebraic systems ...
Abstract. The discovery of invariants and ranking functions plays a central role in program verifica...
AbstractWe propose an algorithm for isolating the real solutions of semi-algebraic systems, which ha...
AbstractWe propose a complete algorithm for real solution isolation for semialgebraic systems by usi...
We propose a complete algorithm for real solution isolation for semialgebraic systems by using inter...
AbstractWe present a complete and practical algorithm which can determine the number of distinct rea...
We discuss parametric polynomial systems, with algorithms for real root classification and triangula...
Solving polynomial systems is an active research area located between computer sciences and mathemat...
AbstractIn this paper, robust semi-definite programs are considered with the goal of verifying wheth...
AbstractA new algorithm is presented for solving algebraic systems of equations, which is designed f...
Real algebraic geometry deals with the solution set of (possibly quantified) systems of polynomial e...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
This paper is concerned with exact real solving of well-constrained, bivariate polynomial sys-tems. ...
Recent advances in program verification indicate that various verification problems can be reduced t...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
This paper discusses the implementation of a reduction algorithm for differential-algebraic systems ...
Abstract. The discovery of invariants and ranking functions plays a central role in program verifica...
AbstractWe propose an algorithm for isolating the real solutions of semi-algebraic systems, which ha...
AbstractWe propose a complete algorithm for real solution isolation for semialgebraic systems by usi...
We propose a complete algorithm for real solution isolation for semialgebraic systems by using inter...
AbstractWe present a complete and practical algorithm which can determine the number of distinct rea...
We discuss parametric polynomial systems, with algorithms for real root classification and triangula...
Solving polynomial systems is an active research area located between computer sciences and mathemat...
AbstractIn this paper, robust semi-definite programs are considered with the goal of verifying wheth...
AbstractA new algorithm is presented for solving algebraic systems of equations, which is designed f...
Real algebraic geometry deals with the solution set of (possibly quantified) systems of polynomial e...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
This paper is concerned with exact real solving of well-constrained, bivariate polynomial sys-tems. ...
Recent advances in program verification indicate that various verification problems can be reduced t...
Computing the real roots of a polynomial is a fundamental problem of computational algebra. We descr...
This paper discusses the implementation of a reduction algorithm for differential-algebraic systems ...
Abstract. The discovery of invariants and ranking functions plays a central role in program verifica...