activity
20032026
most citedTowards a theory of non-commutative optimization: geodesic first and second order methods for moment maps and polytopes

64 citations · 414 across the 34 of their papers we have counts for

collaborators
Showing 2003Show all

2 papers · 1 filter

cs.CC2003★ 2 cited

Counting complexity classes for numeric computations II: algebraic and semialgebraic sets

Peter Buergisser, Felipe Cucker

We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solut…

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…