Pushkar S. Joglekar

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A multivariate to bivariate reduction for noncommutative rank and related results	2026-01-14	Paper
On efficient noncommutative polynomial factorization via Higman linearization Computational Complexity	2025-08-25	Paper
Multivariate to bivariate reduction for noncommutative polynomial factorization	2024-12-03	Paper
Multivariate to bivariate reduction for noncommutative polynomial factorization Information and Computation	2024-12-03	Paper
On efficient noncommutative polynomial factorization via Higman linearization	2024-07-05	Paper
On the complexity of noncommutative polynomial factorization Information and Computation	2018-09-27	Paper
On weak-space complexity over complex numbers	2017-11-22	Paper
On the Expressive Power of Read-Once Determinants Fundamentals of Computation Theory	2015-09-29	Paper
On the complexity of noncommutative polynomial factorization Lecture Notes in Computer Science	2015-09-16	Paper
Arithmetic circuits and the Hadamard product of polynomials	2012-10-24	Paper
Some sieving algorithms for lattice problems	2012-10-19	Paper
On Lower Bounds for Constant Width Arithmetic Circuits Algorithms and Computation	2009-12-17	Paper
Arithmetic Circuits, Monomial Algebras and Finite Automata Mathematical Foundations of Computer Science 2009	2009-10-16	Paper
Algorithmic Problems for Metrics on Permutation Groups SOFSEM 2008: Theory and Practice of Computer Science	2008-03-07	Paper

Research outcomes over time

This page was built for person: Pushkar S. Joglekar