Divide and Conquer Roadmap for Algebraic Sets
نویسندگان
چکیده
منابع مشابه
Divide and Conquer Roadmap for Algebraic Sets
Let R be a real closed field, and D ⊂ R an ordered domain. We describe an algorithm that given as input a polynomial P ∈ D[X1, . . . , Xk], and a finite set, A = {p1, . . . , pm}, of points contained in V = Zer(P,Rk) described by real univariate representations, computes a roadmap of V containing A. The complexity of the algorithm, measured by the number of arithmetic operations in D is bounded...
متن کاملDivide-And-Conquer Computation of Cylindrical Algebraic Decomposition
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, computes cylindrical algebraic decompositions of solution sets of the subformulas, and combines the results using the algorithm first introduced in [34]. We propose a graph-based heuristic to find a suitable partitioning ...
متن کاملCounting independent sets via Divide Measure and Conquer method
Abstract. In this paper we give an algorithm for counting the number of all independent sets in a given graph which works in time O(1.1394) for subcubic graphs and in time O(1.2369) for general graphs, where n is the number of vertices in the instance graph, and polynomial space. The result comes from combining two well known methods “Divide and Conquer” and “Measure and Conquer”. We introduce ...
متن کاملDivide and Conquer
An instance of the given problem is divided into easier instances of the same problem, which are solved recursively and then combined to create a solution to the original instance. Of course, divide and conquer is not suitable for every problem. A divide and conquer approach will only work if the problem is easily divided into a small number of easier sub-problems, and the solution to the entir...
متن کاملDivide and (Iteratively) Conquer!
The Iterative Multi-Agent (IMA) Method works by breaking down a search problem into many sub-problems, each to be solved separately. Independent problem solving agents work on the sub-problems and use iteration to handle any interaction between the sub-problems. Each agent knows about a subset of the whole problem and cannot solve it all by itself. The agents, working in parallel, can use any m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2014
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-014-9610-9