A parallel implementation of the cylindrical algebraic decomposition algorithm

Author(s):  
B. D. Saunders ◽  
H. R. Lee ◽  
S. K. Abdali
Author(s):  
FRANCO CHIAVETTA ◽  
VITO DI GESÙ ◽  
ROSALIA RENDA

In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.


2007 ◽  
Vol 17 (1) ◽  
pp. 99-127 ◽  
Author(s):  
ASSIA MAHBOUBI

The Coq system is a Curry–Howard based proof assistant. Therefore, it contains a full functional, strongly typed programming language, which can be used to enhance the system with powerful automation tools through the implementation of reflexive tactics. We present the implementation of a cylindrical algebraic decomposition algorithm within the Coq system, whose certification leads to a proof producing decision procedure for the first-order theory of real numbers.


2018 ◽  
Vol 22 (3) ◽  
pp. 877-886
Author(s):  
Jordi Mateo ◽  
Lluís M. Plà ◽  
Francesc Solsona ◽  
Adela Pagès

Sign in / Sign up

Export Citation Format

Share Document