Sciweavers

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

114

FOCM
2007

76views more FOCM 2007»

The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties

15 years 2 months ago

The Complexity of Computing the Hilbert Polynomial of Smooth Equidimensional Complex Projective Varieties

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...

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)