Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
23
click to vote
ISSAC
2001
Springer
favorite
Email
discuss
report
103
views
Mathematics
»
more
ISSAC 2001
»
New complexity bounds for cylindrical decompositions of sub-pfaffian sets
14 years 3 months ago
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
more »
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)
Researcher Info
Mathematics Study Group
Computer Vision