( en | de | ru )

 

Disambiguation of "Bhattiprolu, Vijay"

Author of the publication

copydeleteadd this publication to your clipboard
Extending Parikh's Theorem to Weighted and Probabilistic Context-Free Grammars.

, , and . QEST, volume 10503 of Lecture Notes in Computer Science, page 3-19. Springer, (2017)

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.

Balakumar Vijayakrishnan

Vijay Divi

Vijay Singh

Preethi Vijayaraj

Bharadwaj Vijaysarathy

 

Other publications of authors with the same name

Inapproximability of Matrix p → q Norms., , , , and . SIAM J. Comput., 52 (1): 132-155 (February 2023)A framework for quadratic form maximization over convex sets through nonconvex relaxations., , and . STOC, page 870-881. ACM, (2021)Sum-of-Squares Certificates for Maxima of Random Tensors on the Sphere., , and . APPROX-RANDOM, volume 81 of LIPIcs, page 31:1-31:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Inapproximability of Matrix p→q Norms., , , , and . CoRR, (2018)A PTAS for ℓp-Low Rank Approximation., , , , , and . SODA, page 747-766. SIAM, (2019)Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness., , , , and . SODA, page 1358-1368. SIAM, (2019)Extending Parikh's Theorem to Weighted and Probabilistic Context-Free Grammars., , and . QEST, volume 10503 of Lecture Notes in Computer Science, page 3-19. Springer, (2017)Separating the NP-Hardness of the Grothendieck Problem from the Little-Grothendieck Problem., , and . ITCS, volume 215 of LIPIcs, page 22:1-22:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Separating a Voronoi Diagram via Local Search., and . SoCG, volume 51 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)