Partha Mukhopadhyay

发表

Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size

Vikraman Arvind, Partha Mukhopadhyay, 2008, Electron. Colloquium Comput. Complex..

Determinantal Complexity of Iterated Matrix Multiplication Polynomial pdf

Partha Mukhopadhyay, Suryajith Chillara, 2013, ArXiv.

A Note on Polynomial Identity Testing for Depth-3 Circuits pdf

Vikraman Arvind, Partha Mukhopadhyay, Rajit Datta, 2018, ArXiv.

The ideal membership problem and polynomial identity testing

Vikraman Arvind, Partha Mukhopadhyay, V. Arvind, 2010, Inf. Comput..

MmPalateMiRNA, an R package compendium illustrating analysis of miRNA microarray data

Vasyl Pihur, Guy N. Brock, Partha Mukhopadhyay, 2013, Source Code for Biology and Medicine.

Fast Exact Algorithms Using Hadamard Product of Polynomials pdf

Vikraman Arvind, Partha Mukhopadhyay, Rajit Datta, 2018, Algorithmica.

Expanding Generator Sets for Solvable Permutation Groups

Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, 2011, Electron. Colloquium Comput. Complex..

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size

Vikraman Arvind, Partha Mukhopadhyay, V. Arvind, 2008, APPROX-RANDOM.

Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in

Ilya Volkovich, Partha Mukhopadhyay, Amir Shpilka, 2013, SIAM J. Comput..

New Results on Noncommutative and Commutative Polynomial Identity Testing

Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan, 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

Acceptance of Bengal Fasal Bima Yojona by the Farmers: A Study of Purba Burdwan District of West Bengal, India

Partha Mukhopadhyay, Partha Pratim Sengupta, P. Sengupta, 2019, Int. J. Asian Bus. Inf. Manag..

Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields

Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

The Monomial Ideal Membership Problem and Polynomial Identity Testing

Vikraman Arvind, Partha Mukhopadhyay, V. Arvind, 2007, ISAAC.

Isomorphism and canonization of tournaments and hypertournaments

Vikraman Arvind, Partha Mukhopadhyay, Bireswar Das, 2010, J. Comput. Syst. Sci..

Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings

Vikraman Arvind, Partha Mukhopadhyay, S. Raja, 2017, Electron. Colloquium Comput. Complex..

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups

Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, 2012, MFCS.

Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in

Ilya Volkovich, Partha Mukhopadhyay, Amir Shpilka, 2010, STOC '10.

New Results on Noncommutative and Commutative Polynomial Identity Testing

Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan, 2008, Computational Complexity Conference.

Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators pdf

Vikraman Arvind, Partha Mukhopadhyay, Rajit Datta, 2018, FSTTCS.

Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach

Partha Mukhopadhyay, Suryajith Chillara, 2019, computational complexity.

Depth-4 Identity Testing and Noether's Normalization Lemma

Partha Mukhopadhyay, P. Mukhopadhyay, 2016, CSR.

Efficient Black-Box Identity Testing over Free Group Algebra pdf

Vikraman Arvind, Partha Mukhopadhyay, Rajit Datta, 2019, Electron. Colloquium Comput. Complex..

On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields pdf

Partha Mukhopadhyay, Suryajith Chillara, 2014, MFCS.

On Isomorphism and Canonization of Tournaments and Hypertournaments

Vikraman Arvind, Partha Mukhopadhyay, Bireswar Das, 2006, ISAAC.

Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach

Partha Mukhopadhyay, Suryajith Chillara, 2014, STACS.

On the limits of depth reduction at depth 3 over small finite fields

Partha Mukhopadhyay, Suryajith Chillara, 2017, Inf. Comput..

Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs

Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, 2012, LATIN.

Identity Testing for +-Regular Noncommutative Arithmetic Circuits pdf

Vikraman Arvind, Partha Mukhopadhyay, S. Raja, 2016, Electron. Colloquium Comput. Complex..

Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits

Vikraman Arvind, Partha Mukhopadhyay, Rajit Datta, 2018, Electron. Colloquium Comput. Complex..

Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields

Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010, FOCS.

Chapter 4. Centre for Policy Research (CPR): Reforming the Urban Transit System in Delhi

Partha Mukhopadhyay, 2014 .

Quantum Query Complexity of Multilinear Identity Testing

Vikraman Arvind, Partha Mukhopadhyay, 2008, Electron. Colloquium Comput. Complex..

Deutsch-Jozsa Algorithm Revisited in the Domain of Cryptographically Significant Boolean Functions

Subhamoy Maitra, Partha Mukhopadhyay, 2004 .

Equivalence Testing of Weighted Automata over Partially Commutative Monoids

Vikraman Arvind, Partha Mukhopadhyay, Rajit Datta, 2021, MFCS.

Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators

Partha Mukhopadhyay, Rajit Datta, Abhranil Chatterjee, 2021, Theory of Computing Systems.

Monotone Complexity of Spanning Tree Polynomial Re-visited

Arkadev Chattopadhyay, Partha Mukhopadhyay, Rajit Datta, 2022, ITCS.

Pseudorandom generators for CC 0 [p] and the Fourier spectrum of low-degree polynomials over finite fields.

Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka, 2010 .

Exact quantum algorithm to distinguish Boolean functions of different weights

Samuel L. Braunstein, Subhamoy Maitra, Partha Mukhopadhyay, 2007 .

Randomized Polynomial-Time Identity Testing for Noncommutative Circuits

Vikraman Arvind, Partha Mukhopadhyay, S. Raja, 2019, Theory Comput..