Partha Mukhopadhyay

Orcid: 0009-0007-3656-8844

According to our database1, Partha Mukhopadhyay authored at least 48 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Trading Determinism for Noncommutativity in Edmonds' Problem.
Electron. Colloquium Comput. Complex., 2024

2023
A general estimation technique of population mean under stratified successive sampling in presence of random scrambled response and non-response.
Commun. Stat. Simul. Comput., November, 2023

Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.
Electron. Colloquium Comput. Complex., 2023

The Noncommutative Edmonds' Problem Re-visited.
CoRR, 2023

On Identity Testing and Noncommutative Rank Computation over the Free Skew Field.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
Theory Comput. Syst., 2022

Robustly Separating the Arithmetic Monotone Hierarchy Via Graph Inner-Product.
Electron. Colloquium Comput. Complex., 2022

Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time.
Electron. Colloquium Comput. Complex., 2022

Fast Exact Algorithms Using Hadamard Product of Polynomials.
Algorithmica, 2022

Monotone Complexity of Spanning Tree Polynomial Re-Visited.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Equivalence Testing of Weighted Automata over Partially Commutative Monoids.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Negations Provide Strongly Exponential Savings.
Electron. Colloquium Comput. Complex., 2020

Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity.
Electron. Colloquium Comput. Complex., 2020

Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids.
CoRR, 2020

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
Chic. J. Theor. Comput. Sci., 2020

A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits.
Theory Comput., 2019

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., 2019

Efficient Black-Box Identity Testing for Free Group Algebra.
Electron. Colloquium Comput. Complex., 2019

Efficient Black-Box Identity Testing over Free Group Algebra.
CoRR, 2019

Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach.
Comput. Complex., 2019

Efficient Black-Box Identity Testing for Free Group Algebras.
Proceedings of the Approximation, 2019

2018
Expanding Generating Sets for Solvable Permutation Groups.
SIAM J. Discret. Math., 2018

Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits.
Electron. Colloquium Comput. Complex., 2018

A Note on Polynomial Identity Testing for Depth-3 Circuits.
CoRR, 2018

2017
On the limits of depth reduction at depth 3 over small finite fields.
Inf. Comput., 2017

Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.
Electron. Colloquium Comput. Complex., 2017

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Randomized Polynomial Time Identity Testing for Noncommutative Circuits.
Electron. Colloquium Comput. Complex., 2016

Identity Testing for +-Regular Noncommutative Arithmetic Circuits.
Electron. Colloquium Comput. Complex., 2016

2015
Depth-4 Identity Testing and Noether's Normalization Lemma.
Electron. Colloquium Comput. Complex., 2015

2013
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in.
SIAM J. Comput., 2013

MmPalateMiRNA, an R package compendium illustrating analysis of miRNA microarray data.
Source Code Biol. Medicine, 2013

Determinantal Complexity of Iterated Matrix Multiplication Polynomial.
CoRR, 2013

Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields.
Comput. Complex., 2013

2012
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
CoRR, 2012

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Expanding Generator Sets for Solvable Permutation Groups.
Electron. Colloquium Comput. Complex., 2011

Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs.
Electron. Colloquium Comput. Complex., 2011

2010
Isomorphism and canonization of tournaments and hypertournaments.
J. Comput. Syst. Sci., 2010

Pseudorandom generators for CC<sub>0</sub>[p] and the Fourier spectrum of low-degree polynomials over finite fields.
Electron. Colloquium Comput. Complex., 2010

New Results on Noncommutative and Commutative Polynomial Identity Testing.
Comput. Complex., 2010

2008
Quantum Query Complexity of Multilinear Identity Testing.
Electron. Colloquium Comput. Complex., 2008

Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size.
Electron. Colloquium Comput. Complex., 2008

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.
Proceedings of the Approximation, 2008

2007
The Ideal Membership Problem and Polynomial Identity Testing.
Electron. Colloquium Comput. Complex., 2007

The Monomial Ideal Membership Problem and Polynomial Identity Testing.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006
The Complexity of Black-Box Ring Problems.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006


  Loading...