activity
20032026
most citedThe probability that a small perturbation of a numerical analysis problem is difficult

34 citations · 108 across the 17 of their papers we have counts for

collaborators
Showing 2005Show all

1 paper · 1 filter

cs.SC2005★ 1 cited

The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties

Peter Buergisser, Martin Lotz

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the…