5 search results - page 1 / 1 » New complexity bounds for cylindrical decompositions of sub-... |
ISSAC
2001
Springer
13 years 9 months ago
2001
Springer
ISSAC
2009
Springer
13 years 11 months ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
GC
2007
Springer
13 years 5 months ago
2007
Springer
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
CP
2007
Springer
13 years 11 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...