Partha Mukhopadhyay

92 papers A* 6A 7B 8Misc 2Journal 62Unranked 7
YearRankTypeTitle / Venue / Authors
2025 J jnl
Efficient Polynomial Identity Testing Over Nonassociative Algebras.
CoRR
Partha Mukhopadhyay, C. Ramya, Pratik Shastri
2025 J jnl
Efficient Polynomial Identity Testing Over Nonassociative Algebras.
Electron. Colloquium Comput. Complex.
Partha Mukhopadhyay, C. Ramya, Pratik Shastri
2025 A conf
Efficient Polynomial Identity Testing over Nonassociative Algebras.
APPROX/RANDOM
Partha Mukhopadhyay, C. Ramya, Pratik Shastri
2025 — conf
IPS Lower Bounds for Formulas and Sum of ROABPs.
FSTTCS
Prerona Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, Amit Sinhababu
2025 J jnl
IPS Lower Bounds for Formulas and Sum of ROABPs.
CoRR
Prerona Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, Amit Sinhababu
2025 J jnl
IPS Lower Bounds for Formulas and Sum of1 ROABPs.
Electron. Colloquium Comput. Complex.
Prerona Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, Amit Sinhababu
2025 J jnl
Negations are powerful even in small depth.
CoRR
Bruno Cavalar, Théo Borém Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff
2025 J jnl
Negations are powerful even in small depth.
Electron. Colloquium Comput. Complex.
Bruno Pasqualotto Cavalar, Théo Borém Fabris, Partha Mukhopadhyay, Srikanth Srinivasan, Amir Yehudayoff
2024 A* conf
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.
STOC
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2024 A* conf
Trading Determinism for Noncommutativity in Edmonds' Problem.
FOCS
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2024 J jnl
Trading Determinism for Noncommutativity in Edmonds' Problem.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2024 J jnl
Trading Determinism for Noncommutativity in Edmonds' Problem.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2023 J jnl
A general estimation technique of population mean under stratified successive sampling in presence of random scrambled response and non-response.
Commun. Stat. Simul. Comput.
Partha Mukhopadhyay, Garib Nath Singh, Arnab Bandyopadhyay
2023 J jnl
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2023 J jnl
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2023 A conf
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field.
ITCS
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
2023 J jnl
The Noncommutative Edmonds' Problem Re-visited.
CoRR
Abhranil Chatterjee, Partha Mukhopadhyay
2022 A conf
Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time.
APPROX/RANDOM
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2022 J jnl
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2022 J jnl
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2022 J jnl
Fast Exact Algorithms Using Hadamard Product of Polynomials.
Algorithmica
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2022 A conf
Monotone Complexity of Spanning Tree Polynomial Re-Visited.
ITCS
Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay
2022 J jnl
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
2022 J jnl
Robustly Separating the Arithmetic Monotone Hierarchy Via Graph Inner-Product.
Electron. Colloquium Comput. Complex.
Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay
2022 — conf
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product.
FSTTCS
Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay
2022 J jnl
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
Theory Comput. Syst.
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2021 B conf
Equivalence Testing of Weighted Automata over Partially Commutative Monoids.
MFCS
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2021 A* conf
Lower bounds for monotone arithmetic circuits via communication complexity.
STOC
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
2021 J jnl
Monotone Complexity of Spanning Tree Polynomial Re-visited.
CoRR
Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay
2020 B conf
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.
MFCS
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2020 J jnl
Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity.
Electron. Colloquium Comput. Complex.
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
2020 J jnl
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2020 J jnl
Negations Provide Strongly Exponential Savings.
Electron. Colloquium Comput. Complex.
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
2020 J jnl
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
Chic. J. Theor. Comput. Sci.
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 J jnl
Acceptance of Bengal Fasal Bima Yojona by the Farmers: A Study of Purba Burdwan District of West Bengal, India.
Int. J. Asian Bus. Inf. Manag.
Partha Mukhopadhyay, Partha Pratim Sengupta
2019 J jnl
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach.
Comput. Complex.
Suryajith Chillara, Partha Mukhopadhyay
2019 J jnl
Efficient Black-Box Identity Testing for Free Group Algebra.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 — conf
Efficient Black-Box Identity Testing for Free Group Algebras.
APPROX-RANDOM
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 J jnl
Efficient Black-Box Identity Testing over Free Group Algebra.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 — conf
Fast Exact Algorithms Using Hadamard Product of Polynomials.
FSTTCS
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 B conf
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
ISAAC
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 J jnl
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 J jnl
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits.
Theory Comput.
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
2018 J jnl
A Note on Polynomial Identity Testing for Depth-3 Circuits.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2018 J jnl
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2018 J jnl
Expanding Generating Sets for Solvable Permutation Groups.
SIAM J. Discret. Math.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2018 J jnl
Fast Exact Algorithms Using Hadamard Product of Polynomials.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2018 — conf
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
FSTTCS
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2018 J jnl
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2017 B conf
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings.
MFCS
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
2017 J jnl
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.
CoRR
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
2017 J jnl
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S
2017 J jnl
On the limits of depth reduction at depth 3 over small finite fields.
Inf. Comput.
Suryajith Chillara, Partha Mukhopadhyay
2017 A* conf
Randomized polynomial time identity testing for noncommutative circuits.
STOC
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
2016 Misc conf
Depth-4 Identity Testing and Noether's Normalization Lemma.
CSR
Partha Mukhopadhyay
2016 J jnl
Identity Testing for +-Regular Noncommutative Arithmetic Circuits.
CoRR
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
2016 J jnl
Identity Testing for +-Regular Noncommutative Arithmetic Circuits.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, Raja S
2016 J jnl
Randomized Polynomial Time Identity Testing for Noncommutative Circuits.
CoRR
Vikraman Arvind, Partha Mukhopadhyay, S. Raja
2016 J jnl
Randomized Polynomial Time Identity Testing for Noncommutative Circuits.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Raja S
2015 J jnl
Depth-4 Identity Testing and Noether's Normalization Lemma.
Electron. Colloquium Comput. Complex.
Partha Mukhopadhyay
2014 A conf
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach.
STACS
Suryajith Chillara, Partha Mukhopadhyay
2014 — conf
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields.
MFCS (2)
Suryajith Chillara, Partha Mukhopadhyay
2014 J jnl
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields.
CoRR
Suryajith Chillara, Partha Mukhopadhyay
2013 J jnl
Determinantal Complexity of Iterated Matrix Multiplication Polynomial.
CoRR
Suryajith Chillara, Partha Mukhopadhyay
2013 J jnl
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in.
SIAM J. Comput.
Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich
2013 J jnl
MmPalateMiRNA, an R package compendium illustrating analysis of miRNA microarray data.
Source Code Biol. Medicine
Guy N. Brock, Partha Mukhopadhyay, Vasyl Pihur, Cynthia Webb, Robert M. Greene, M. Michele Pisano
2013 J jnl
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields.
Comput. Complex.
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
2012 B conf
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs.
LATIN
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
2012 J jnl
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
CoRR
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2012 B conf
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.
MFCS
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2011 J jnl
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
2011 J jnl
Expanding Generator Sets for Solvable Permutation Groups.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2010 A* conf
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in.
STOC
Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich
2010 J jnl
Isomorphism and canonization of tournaments and hypertournaments.
J. Comput. Syst. Sci.
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
2010 J jnl
New Results on Noncommutative and Commutative Polynomial Identity Testing.
Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2010 A* conf
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields.
FOCS
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
2010 J jnl
Pseudorandom generators for CC
Electron. Colloquium Comput. Complex.
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
2010 J jnl
The ideal membership problem and polynomial identity testing.
Inf. Comput.
Vikraman Arvind, Partha Mukhopadhyay
2009 J jnl
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in.
Electron. Colloquium Comput. Complex.
Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich
2009 A conf
Quantum Query Complexity of Multilinear Identity Testing.
STACS
Vikraman Arvind, Partha Mukhopadhyay
2008 J jnl
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
CoRR
Vikraman Arvind, Partha Mukhopadhyay
2008 — conf
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.
APPROX-RANDOM
Vikraman Arvind, Partha Mukhopadhyay
2008 J jnl
Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay
2008 A conf
New Results on Noncommutative and Commutative Polynomial Identity Testing.
CCC
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2008 J jnl
New results on Noncommutative and Commutative Polynomial Identity Testing
CoRR
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2008 J jnl
New results on Noncommutative and Commutative Polynomial Identity Testing.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2008 J jnl
Quantum Query Complexity of Multilinear Identity Testing
CoRR
Vikraman Arvind, Partha Mukhopadhyay
2008 J jnl
Quantum Query Complexity of Multilinear Identity Testing.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay
2007 J jnl
The Ideal Membership Problem and Polynomial Identity Testing.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay
2007 B conf
The Monomial Ideal Membership Problem and Polynomial Identity Testing.
ISAAC
Vikraman Arvind, Partha Mukhopadhyay
2006 B conf
On Isomorphism and Canonization of Tournaments and Hypertournaments.
ISAAC
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
2006 Misc conf
The Complexity of Black-Box Ring Problems.
COCOON
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay