Partha Mukhopadhyay

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.

[BibT_eX]

[DOI]

Garib Nath Singh

Arnab Bandyopadhyay

Commun. Stat. Simul. Comput., November, 2023

Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

The Noncommutative Edmonds' Problem Re-visited.

[BibT_eX]

[DOI]

CoRR, 2023

On Identity Testing and Noncommutative Rank Computation over the Free Skew Field.

[BibT_eX]

[DOI]

Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

2022

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

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

Robustly Separating the Arithmetic Monotone Hierarchy Via Graph Inner-Product.

[BibT_eX]

[DOI]

Utsab Ghosal

Electron. Colloquium Comput. Complex., 2022

Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

Fast Exact Algorithms Using Hadamard Product of Polynomials.

[BibT_eX]

[DOI]

Algorithmica, 2022

Monotone Complexity of Spanning Tree Polynomial Re-Visited.

[BibT_eX]

[DOI]

Rajit Datta

Utsab Ghosal

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Equivalence Testing of Weighted Automata over Partially Commutative Monoids.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Negations Provide Strongly Exponential Savings.

[BibT_eX]

[DOI]

Rajit Datta

Electron. Colloquium Comput. Complex., 2020

Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity.

[BibT_eX]

[DOI]

Rajit Datta

Electron. Colloquium Comput. Complex., 2020

Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids.

[BibT_eX]

[DOI]

CoRR, 2020

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2020

A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Randomized Polynomial-Time Identity Testing for Noncommutative Circuits.

[BibT_eX]

[DOI]

Theory Comput., 2019

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

[BibT_eX]

[DOI]

Partha Pratim Sengupta

Int. J. Asian Bus. Inf. Manag., 2019

Efficient Black-Box Identity Testing for Free Group Algebra.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

Efficient Black-Box Identity Testing over Free Group Algebra.

[BibT_eX]

[DOI]

CoRR, 2019

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

[BibT_eX]

[DOI]

Suryajith Chillara

Comput. Complex., 2019

Efficient Black-Box Identity Testing for Free Group Algebras.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2019

2018

Expanding Generating Sets for Solvable Permutation Groups.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2018

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

[BibT_eX]

[DOI]

CoRR, 2018

2017

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

[BibT_eX]

[DOI]

Suryajith Chillara

Inf. Comput., 2017

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

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2017

Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Randomized Polynomial Time Identity Testing for Noncommutative Circuits.

[BibT_eX]

[DOI]

Raja S

Electron. Colloquium Comput. Complex., 2016

Identity Testing for +-Regular Noncommutative Arithmetic Circuits.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2016

2015

Depth-4 Identity Testing and Noether's Normalization Lemma.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

2013

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

[BibT_eX]

[DOI]

SIAM J. Comput., 2013

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

[BibT_eX]

[DOI]

Source Code Biol. Medicine, 2013

Determinantal Complexity of Iterated Matrix Multiplication Polynomial.

[BibT_eX]

[DOI]

Suryajith Chillara

CoRR, 2013

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

[BibT_eX]

[DOI]

Shachar Lovett

Amir Shpilka

Comput. Complex., 2013

2012

Near-Optimal Expanding Generating Sets for Solvable Permutation Groups

[BibT_eX]

[DOI]

CoRR, 2012

Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Expanding Generator Sets for Solvable Permutation Groups.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2011

Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs.

[BibT_eX]

[DOI]

Prajakta Nimbhorkar

Electron. Colloquium Comput. Complex., 2011

2010

Isomorphism and canonization of tournaments and hypertournaments.

[BibT_eX]

[DOI]

Bireswar Das

J. Comput. Syst. Sci., 2010

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

[BibT_eX]

[DOI]

Shachar Lovett

Amir Shpilka

Electron. Colloquium Comput. Complex., 2010

New Results on Noncommutative and Commutative Polynomial Identity Testing.

[BibT_eX]

[DOI]

Srikanth Srinivasan

Comput. Complex., 2010

2008

Quantum Query Complexity of Multilinear Identity Testing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2008

Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2008

Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2008

2007

The Ideal Membership Problem and Polynomial Identity Testing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2007

The Monomial Ideal Membership Problem and Polynomial Identity Testing.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

2006

The Complexity of Black-Box Ring Problems.

[BibT_eX]

[DOI]

Bireswar Das