activity
20112021
most citedDivide-And-Conquer Computation of Cylindrical Algebraic Decomposition

4 citations · 4 across the 7 of their papers we have counts for

collaborators
Showing cs.SCShow all

7 papers · 1 filter

cs.SC2021

Computing Limits of Quotients of Multivariate Real Analytic Functions

Adam Strzebonski

We present an algorithm for computing limits of quotients of real analytic functions. The algorithm is based on computation of a bound on the Lojasiewicz exponent and requires the…

cs.SC2019

Asymptotic Solutions of Polynomial Equations with Exp-Log Coefficients

Adam Strzeboński

We present an algorithm for computing asymptotic approximations of roots of polynomials with exp-log function coefficients. The real and imaginary parts of the approximations are g…

cs.SC2017

CAD Adjacency Computation Using Validated Numerics

Adam Strzebonski

We present an algorithm for computation of cell adjacencies for well-based cylindrical algebraic decomposition. Cell adjacency information can be used to compute topological operat…

cs.SC2017

Algorithm for computing semi-Fourier sequences of expressions involving exponentiations and integrations

Hoon Hong, Adam Strzebonski

We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is…

cs.SC2014

Cylindrical Algebraic Decomposition Using Local Projections

Adam Strzebonski

We present an algorithm which computes a cylindrical algebraic decomposition of a semialgebraic set using projection sets computed for each cell separately. Such local projection s…

cs.SC2014★ 4 cited

Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition

Adam Strzebonski

We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, comp…