( en | de | ru )

 

Disambiguation of "Joglekar, Pushkar S."

Author of the publication

copydeleteadd this publication to your clipboard
On Weak-Space Complexity over Complex Numbers.

, , and . Electron. Colloquium Comput. Complex., (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.

Chandrashekhar Joglekar

Yulia Pushkar

Pushkar Tripathi

S Hilt

S Ulrich

 

Other publications of authors with the same name

Noncommutative Valiant's Classes: Structure and Complete Problems., , and . CoRR, (2015)On Lower Bounds for Constant Width Arithmetic Circuits., , and . Electron. Colloquium Comput. Complex., (2009)Randomized polynomial time identity testing for noncommutative circuits., , , and . STOC, page 831-841. ACM, (2017)Urdu & Hindi Poetry Generation using Neural Networks., and . CoRR, (2021)Performance Measurement of Prostate Gland Segmentation Approaches in Transrectal Ultrasound and Magnetic Resonance Images., , , and . CVMLH/WTEK, volume 3338 of CEUR Workshop Proceedings, page 15-25. CEUR-WS.org, (2022)On Efficient Noncommutative Polynomial Factorization via Higman Linearization., and . CCC, volume 234 of LIPIcs, page 12:1-12:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Noncommutative Valiant's Classes: Structure and Complete Problems., , and . TOCT, 9 (1): 3:1-3:29 (2016)Identity Testing for +-Regular Noncommutative Arithmetic Circuits., , , and . CoRR, (2016)On the complexity of noncommutative polynomial factorization., , and . Inf. Comput., (2018)Arithmetic Circuits, Monomial Algebras and Finite Automata., and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 78-89. Springer, (2009)