( en | de | ru )

 

Disambiguation of "Bläser, Markus"

Author of the publication

copydeleteadd this publication to your clipboard
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials.

, , , and . SODA, page 647-661. SIAM, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Markus Bläser

Markus Blaser

Markus Blaser

Peter Bläser

Ralf Bläser

 

Other publications of authors with the same name

Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 22371)., , , and . Dagstuhl Reports, 12 (9): 41-59 (September 2022)A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials., , , and . SODA, page 647-661. SIAM, (2019)On the Complexity of Evaluating Highest Weight Vectors., , and . CCC, volume 200 of LIPIcs, page 29:1-29:36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Algebraic Methods in Computational Complexity (Dagstuhl Seminar 18391)., , , and . Dagstuhl Reports, 8 (9): 133-153 (2018)A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication.. STACS, volume 2010 of Lecture Notes in Computer Science, page 99-109. Springer, (2001)Identification for Tree-shaped Structural Causal Models in Polynomial Time., and . CoRR, (2023)A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields.. FOCS, page 45-50. IEEE Computer Society, (1999)Not all Strongly Rayleigh Distributions Have Small Probabilistic Generating Circuits.. ICML, volume 202 of Proceedings of Machine Learning Research, page 2592-2602. PMLR, (2023)On the complexity of evaluating highest weight vectors., , and . CoRR, (2020)Variety Membership Testing, Algebraic Natural Proofs, and Geometric Complexity Theory., , , , and . CoRR, (2019)