1 citations · 1 across the 2 of their papers we have counts for
2 papers
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…
cs.CC2003
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps
Peter Buergisser, Martin Lotz
We prove lower bounds of order for both the problem to multiply polynomials of degree , and to divide polynomials with remainder, in the model of bounded coefficient a…