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
19
click to vote
FSTTCS
2004
Springer
favorite
Email
discuss
report
84
views
Software Engineering
»
more
FSTTCS 2004
»
On the Complexity of Hilbert's 17th Problem
14 years 1 months ago
Download
research.microsoft.com
Nikhil R. Devanur, Richard J. Lipton, Nisheeth K.
Real-time Traffic
FSTTCS 2004
|
claim paper
Related Content
»
On Smales 17th Problem A Probabilistic Positive Solution
»
Lossless and Dissipative Distributed Systems
»
Hilberts Thirteenth Problem and Circuit Complexity
»
The regularized least squares algorithm and the problem of learning halfspaces
»
Algorithms for ray class groups and Hilbert class fields
»
Modal Logics with Counting
»
Design of Hilbert transform pairs of orthonormal wavelet bases with improved analyticity
»
Lower bounds for the complexity of linear functionals in the randomized setting
»
Complexity versus Agreement for Many Views
more »
Post Info
More Details (n/a)
Added
01 Jul 2010
Updated
01 Jul 2010
Type
Conference
Year
2004
Where
FSTTCS
Authors
Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision