( en | de | ru )

 

Disambiguation of "Pandey, Anurag"

Author of the publication

copydeleteadd this publication to your clipboard
On the Orbit Closure Containment Problem and Slice Rank of Tensors.

, , , , and . SODA, page 2565-2584. SIAM, (2021)

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.

Shantanu Pandey

Anurag Gupta

Anurag Anand

Anurag Mishra

Anurag Dave

 

Other publications of authors with the same name

Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits., , and . MFCS, volume 58 of LIPIcs, page 74:1-74:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials., , , and . SODA, page 647-661. SIAM, (2019)On the Orbit Closure Containment Problem and Slice Rank of Tensors., , , , and . SODA, page 2565-2584. SIAM, (2021)Monotone Arithmetic Complexity of Graph Homomorphism Polynomials., , and . ICALP, volume 229 of LIPIcs, page 83:1-83:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Variety membership testing in algebraic complexity theory.. Saarland University, Germany, (2021)A Deterministic PTAS for the Commutative Rank of Matrix Spaces., , and . Theory Comput., 14 (1): 1-21 (2018)A Blockchain Approach for Securing Certification Management System., , and . IC3I, page 147-152. IEEE, (2023)Polynomial Identity Testing for Low Degree Polynomials with Optimal Randomness., and . APPROX-RANDOM, volume 176 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Algebraic Branching Programs, Border Complexity, and Tangent Spaces., , , , and . CCC, volume 169 of LIPIcs, page 21:1-21:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)How many zeros of a random sparse polynomial are real?, , , and . ISSAC, page 273-280. ACM, (2020)