1 citations · 2 across the 8 of their papers we have counts for
4 papers · 1 filter
Convex optimization on moment polytopes: Hadamard mirror descent and efficient algorithms for quantum functionals and other tensor parameters
Mahmut Levent Doğan, Keiya Sakabe, Michael Walter
Convex optimization on polytopes arises in many areas of science. When the polytope is given implicitly or has exponentially many vertices and facets, standard methods may not appl…
Strassen's support functionals coincide with the quantum functionals
Keiya Sakabe, Mahmut Levent Doğan, Michael Walter
Strassen's asymptotic spectrum offers a framework for analyzing the complexity of tensors. It has found applications in diverse areas, from computer science to additive combinatori…
Complexity of Robust Orbit Problems for Torus Actions and the abc-conjecture
Peter Bürgisser, Mahmut Levent Doğan, Visu Makam +2
When a group acts on a set, it naturally partitions it into orbits, giving rise to orbit problems. These are natural algorithmic problems, as symmetries are central in numerous que…
On the complexity of Chow and Hurwitz forms
Mahmut Levent Doğan, Alperen Ali Ergür, Elias Tsigaridas
We consider the bit complexity of computing Chow forms and their generalization to multiprojective spaces. We develop a deterministic algorithm using resultants and obtain a single…