Partha Mukhopadhyay

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 50

Top Topics

Top Venues

Electron. Colloquium Comput. Complex.

Publications

Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Trading Determinism for Noncommutativity in Edmonds' Problem. Electron. Colloquium Comput. Complex. (2024)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. STOC (2024)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Trading Determinism for Noncommutativity in Edmonds' Problem. CoRR (2024)
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. ITCS (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. CoRR (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. Electron. Colloquium Comput. Complex. (2023)
Partha Mukhopadhyay, Garib Nath Singh, Arnab Bandyopadhyay
A general estimation technique of population mean under stratified successive sampling in presence of random scrambled response and non-response. Commun. Stat. Simul. Comput. 52 (11) (2023)
Abhranil Chatterjee, Partha Mukhopadhyay
The Noncommutative Edmonds' Problem Re-visited. CoRR (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time. APPROX/RANDOM (2022)
Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay
Robustly Separating the Arithmetic Monotone Hierarchy Via Graph Inner-Product. Electron. Colloquium Comput. Complex. (2022)
Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay
Monotone Complexity of Spanning Tree Polynomial Re-Visited. ITCS (2022)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. Electron. Colloquium Comput. Complex. (2022)
Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product. FSTTCS (2022)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. Theory Comput. Syst. 66 (1) (2022)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. Algorithmica 84 (2) (2022)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. CoRR (2022)
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. CoRR (2022)
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
Lower bounds for monotone arithmetic circuits via communication complexity. STOC (2021)
Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay
Monotone Complexity of Spanning Tree Polynomial Re-visited. CoRR (2021)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Equivalence Testing of Weighted Automata over Partially Commutative Monoids. MFCS (2021)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. CoRR (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. MFCS (2020)
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
Negations Provide Strongly Exponential Savings. Electron. Colloquium Comput. Complex. 27 (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. Chic. J. Theor. Comput. Sci. 2020 (2020)
Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay
Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity. Electron. Colloquium Comput. Complex. 27 (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. CoRR (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. ISAAC (2019)
Suryajith Chillara, Partha Mukhopadhyay
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. Comput. Complex. 28 (4) (2019)
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. Theory Comput. 15 (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing over Free Group Algebra. CoRR (2019)
Partha Mukhopadhyay, Partha Pratim Sengupta
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. 10 (2) (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing for Free Group Algebra. Electron. Colloquium Comput. Complex. 26 (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. FSTTCS (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing for Free Group Algebras. APPROX-RANDOM (2019)
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
Expanding Generating Sets for Solvable Permutation Groups. SIAM J. Discret. Math. 32 (3) (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. CoRR (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
A Note on Polynomial Identity Testing for Depth-3 Circuits. CoRR (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. FSTTCS (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. CoRR (2018)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. MFCS (2017)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. CoRR (2017)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. Electron. Colloquium Comput. Complex. 24 (2017)
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
Randomized polynomial time identity testing for noncommutative circuits. STOC (2017)
Suryajith Chillara, Partha Mukhopadhyay
On the limits of depth reduction at depth 3 over small finite fields. Inf. Comput. 256 (2017)
Vikraman Arvind, Partha Mukhopadhyay, S. Raja
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. CoRR (2016)
Partha Mukhopadhyay
Depth-4 Identity Testing and Noether's Normalization Lemma. CSR (2016)
Vikraman Arvind, Partha Mukhopadhyay, Raja S
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. Electron. Colloquium Comput. Complex. 23 (2016)
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. CoRR (2016)
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, Raja S
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. 23 (2016)
Partha Mukhopadhyay
Depth-4 Identity Testing and Noether's Normalization Lemma. Electron. Colloquium Comput. Complex. 22 (2015)
Suryajith Chillara, Partha Mukhopadhyay
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. CoRR (2014)
Suryajith Chillara, Partha Mukhopadhyay
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. STACS (2014)
Suryajith Chillara, Partha Mukhopadhyay
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. MFCS (2) (2014)
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. Comput. Complex. 22 (4) (2013)
Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in. SIAM J. Comput. 42 (6) (2013)
Suryajith Chillara, Partha Mukhopadhyay
Determinantal Complexity of Iterated Matrix Multiplication Polynomial. CoRR (2013)
Guy N. Brock, Partha Mukhopadhyay, Vasyl Pihur, Cynthia Webb, Robert M. Greene, M. Michele Pisano
MmPalateMiRNA, an R package compendium illustrating analysis of miRNA microarray data. Source Code Biol. Medicine 8 (2013)
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. LATIN (2012)
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups CoRR (2012)
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. MFCS (2012)
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
Expanding Generator Sets for Solvable Permutation Groups. Electron. Colloquium Comput. Complex. 18 (2011)
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. Electron. Colloquium Comput. Complex. 18 (2011)
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
New Results on Noncommutative and Commutative Polynomial Identity Testing. Comput. Complex. 19 (4) (2010)
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
Isomorphism and canonization of tournaments and hypertournaments. J. Comput. Syst. Sci. 76 (7) (2010)
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. FOCS (2010)
Vikraman Arvind, Partha Mukhopadhyay
The ideal membership problem and polynomial identity testing. Inf. Comput. 208 (4) (2010)
Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. STOC (2010)
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
[p] and the Fourier spectrum of low-degree polynomials over finite fields. Electron. Colloquium Comput. Complex. 17 (2010)
Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. Electron. Colloquium Comput. Complex. 16 (2009)
Vikraman Arvind, Partha Mukhopadhyay
Quantum Query Complexity of Multilinear Identity Testing. STACS (2009)
Vikraman Arvind, Partha Mukhopadhyay
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. APPROX-RANDOM (2008)
Vikraman Arvind, Partha Mukhopadhyay
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size CoRR (2008)
Vikraman Arvind, Partha Mukhopadhyay
Quantum Query Complexity of Multilinear Identity Testing CoRR (2008)
Vikraman Arvind, Partha Mukhopadhyay
Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. Electron. Colloquium Comput. Complex. 15 (049) (2008)
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
New results on Noncommutative and Commutative Polynomial Identity Testing CoRR (2008)
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
New results on Noncommutative and Commutative Polynomial Identity Testing. Electron. Colloquium Comput. Complex. 15 (025) (2008)
Vikraman Arvind, Partha Mukhopadhyay
Quantum Query Complexity of Multilinear Identity Testing. Electron. Colloquium Comput. Complex. 15 (086) (2008)
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
New Results on Noncommutative and Commutative Polynomial Identity Testing. Computational Complexity Conference (2008)
Vikraman Arvind, Partha Mukhopadhyay
The Monomial Ideal Membership Problem and Polynomial Identity Testing. ISAAC (2007)
Vikraman Arvind, Partha Mukhopadhyay
The Ideal Membership Problem and Polynomial Identity Testing. Electron. Colloquium Comput. Complex. 14 (095) (2007)
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
The Complexity of Black-Box Ring Problems. COCOON (2006)
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
On Isomorphism and Canonization of Tournaments and Hypertournaments. ISAAC (2006)