( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials.

, , , и . SODA, стр. 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.

Markus Bläser

Markus Blaser

Markus Blaser

Peter Bläser

Harald Bläser

 

Другие публикации лиц с тем же именем

A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials., , , и . SODA, стр. 647-661. SIAM, (2019)On Digital Signatures Based on Group Actions: QROM Security and Ring Signatures., , , , , , , , и . PQCrypto (1), том 14771 из Lecture Notes in Computer Science, стр. 227-261. Springer, (2024)On the Complexity of Evaluating Highest Weight Vectors., , и . CCC, том 200 из LIPIcs, стр. 29:1-29:36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)A (5/2)n2-Lower Bound for the Multiplicative Complexity of n×n-Matrix Multiplication.. STACS, том 2010 из Lecture Notes in Computer Science, стр. 99-109. Springer, (2001)Identification for Tree-shaped Structural Causal Models in Polynomial Time., и . CoRR, (2023)Not all Strongly Rayleigh Distributions Have Small Probabilistic Generating Circuits.. ICML, том 202 из Proceedings of Machine Learning Research, стр. 2592-2602. PMLR, (2023)A 5/2 n2-Lower Bound for the Rank of n×n Matrix Multiplication over Arbitrary Fields.. FOCS, стр. 45-50. IEEE Computer Society, (1999)On the Orbit Closure Containment Problem and Slice Rank of Tensors., , , , и . SODA, стр. 2565-2584. SIAM, (2021)Identification for Tree-Shaped Structural Causal Models in Polynomial Time., и . AAAI, стр. 20404-20411. AAAI Press, (2024)On the Complexity of Symmetric Polynomials., и . ITCS, том 124 из LIPIcs, стр. 47:1-47:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)