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
31
click to vote
FOCM
2007
favorite
Email
discuss
report
76
views
more
FOCM 2007
»
The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties
13 years 11 months ago
Download
math-www.uni-paderborn.de
Peter Bürgisser, Martin Lotz
Real-time Traffic
FOCM 2007
|
claim paper
Related Content
»
On the complexity of deciding connectedness and computing Betti numbers of a complex algeb...
»
On the complexity of the resolvent representation of some prime differential ideals
»
Lower bounds for the complexity of linear functionals in the randomized setting
»
On the Hardness and Smoothed Complexity of QuasiConcave Minimization
»
On the geometry of polar varieties
»
Construction of Hyperelliptic Curves with CM and Its Application to Cryptosystems
»
Variationaware interconnect extraction using statistical moment preserving model order red...
more »
Post Info
More Details (n/a)
Added
14 Dec 2010
Updated
14 Dec 2010
Type
Journal
Year
2007
Where
FOCM
Authors
Peter Bürgisser, Martin Lotz
Comments
(0)
Researcher Info
FOCM 2002 Study Group
Computer Vision