We present an algorithm for finding an explicit description of solution sets of systems of strict polynomial inequalities, correct up to lower dimensional algebraic sets. Such a description isâ€¦ (More)

Finding an upper bound for the positive roots of univariate polynomials is an important step of the continued fractions real root isolation algorithm. The revived interest in this algorithm hasâ€¦ (More)

Abstract. In this paper we compare four implementations of the Vincent-AkritasStrzeboÅ„ski Continued Fractions (VAS-CF) real root isolation method using four different (two linear and two quadraticâ€¦ (More)

The Frobenius number g(A) of a set A = (a1, a2, . . . , an) of positive integers is the largest integer not representable as a nonnegative linear combination of the ai. We interpret the Frobeniusâ€¦ (More)

Cylindrical algebraic formulas are an explicit representation of semialgebraic sets as finite unions of cylindrically arranged disjoint cells bounded by graphs of algebraic functions. We present aâ€¦ (More)

Cylindrical algebraic formulas are an explicit representation of semialgebraic sets as finite unions of cylindrically arranged disjoint cells bounded by graphs of algebraic functions. We present aâ€¦ (More)

We study the problem of solving, possibly quantified, systems of real algebraic equations and inequalities. We propose a way of representing solution sets in a computer algebra system and present anâ€¦ (More)