Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ISSAC
2001
Springer

favoriteEmaildiscussreport

103views Mathematics» more ISSAC 2001»

New complexity bounds for cylindrical decompositions of sub-pfaffian sets

13 years 9 months ago

New complexity bounds for cylindrical decompositions of sub-pfaffian sets

Download people.bath.ac.uk

Savvas Pericleous, Nicolai Vorobjov

Real-time Traffic

ISSAC 2001 | Mathematics |

claim paper

Related Content

» Computing cylindrical algebraic decomposition via triangular decomposition

» Decompositions Partitions and Coverings with Convex Polygons and PseudoTriangles

» Generalized hypertree decompositions nphardness and tractable variants

» Structural Relaxations by Variable Renaming and Their Compilation for Solving MinCostSAT

Post Info
More Details (n/a)

Added	30 Jul 2010
Updated	30 Jul 2010
Type	Conference
Year	2001
Where	ISSAC
Authors	Savvas Pericleous, Nicolai Vorobjov

Comments (0)