default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPartha Mukhopadhyay
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c28]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. FOCS 2024: 539-559- [c27]Vikraman Arvind
, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. STOC 2024: 106-117 - [i41]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. CoRR abs/2404.07986 (2024) - [i40]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j15]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): 5288-5308 (2023) - [c26]Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya:
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. ITCS 2023: 6:1-6:23 - [i39]Abhranil Chatterjee, Partha Mukhopadhyay:
The Noncommutative Edmonds' Problem Re-visited. CoRR abs/2305.09984 (2023) - [i38]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. CoRR abs/2309.15647 (2023) - [i37]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j14]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. Algorithmica 84(2): 436-463 (2022) - [j13]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. Theory Comput. Syst. 66(1): 56-88 (2022) - [c25]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: 23:1-23:22 - [c24]Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay:
Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product. FSTTCS 2022: 12:1-12:20 - [c23]Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay:
Monotone Complexity of Spanning Tree Polynomial Re-Visited. ITCS 2022: 39:1-39:21 - [i36]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. CoRR abs/2202.05693 (2022) - [i35]Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya:
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. CoRR abs/2209.04797 (2022) - [i34]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. TR22 (2022) - [i33]Arkadev Chattopadhyay, Utsab Ghosal, Partha Mukhopadhyay:
Robustly Separating the Arithmetic Monotone Hierarchy Via Graph Inner-Product. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c22]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Equivalence Testing of Weighted Automata over Partially Commutative Monoids. MFCS 2021: 10:1-10:15 - [c21]Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay:
Lower bounds for monotone arithmetic circuits via communication complexity. STOC 2021: 786-799 - [i32]Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay:
Monotone Complexity of Spanning Tree Polynomial Re-visited. CoRR abs/2109.06941 (2021) - 2020
- [j12]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) - [c20]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. MFCS 2020: 10:1-10:14 - [i31]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. CoRR abs/2002.08633 (2020) - [i30]Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay:
Lower Bounds for Monotone Arithmetic Circuits Via Communication Complexity. Electron. Colloquium Comput. Complex. TR20 (2020) - [i29]Arkadev Chattopadhyay, Rajit Datta, Partha Mukhopadhyay:
Negations Provide Strongly Exponential Savings. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j11]Suryajith Chillara, Partha Mukhopadhyay:
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. Comput. Complex. 28(4): 545-572 (2019) - [j10]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): 126-142 (2019) - [j9]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. Theory Comput. 15: 1-36 (2019) - [c19]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing for Free Group Algebras. APPROX-RANDOM 2019: 57:1-57:16 - [c18]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. FSTTCS 2019: 9:1-9:14 - [c17]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. ISAAC 2019: 38:1-38:13 - [i28]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing over Free Group Algebra. CoRR abs/1904.12337 (2019) - [i27]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. CoRR abs/1908.08347 (2019) - [i26]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing for Free Group Algebra. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j8]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Expanding Generating Sets for Solvable Permutation Groups. SIAM J. Discret. Math. 32(3): 1721-1740 (2018) - [c16]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. FSTTCS 2018: 7:1-7:18 - [i25]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
A Note on Polynomial Identity Testing for Depth-3 Circuits. CoRR abs/1805.06692 (2018) - [i24]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. CoRR abs/1807.04496 (2018) - [i23]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. CoRR abs/1808.10787 (2018) - [i22]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j7]Suryajith Chillara, Partha Mukhopadhyay:
On the limits of depth reduction at depth 3 over small finite fields. Inf. Comput. 256: 35-44 (2017) - [c15]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja:
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. MFCS 2017: 38:1-38:13 - [c14]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized polynomial time identity testing for noncommutative circuits. STOC 2017: 831-841 - [i21]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja:
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. CoRR abs/1705.00140 (2017) - [i20]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S:
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c13]Partha Mukhopadhyay:
Depth-4 Identity Testing and Noether's Normalization Lemma. CSR 2016: 309-323 - [i19]Vikraman Arvind, Partha Mukhopadhyay, S. Raja:
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. CoRR abs/1606.00596 (2016) - [i18]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. CoRR abs/1611.07235 (2016) - [i17]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, Raja S:
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - [i16]Vikraman Arvind, Partha Mukhopadhyay, Raja S:
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [i15]Partha Mukhopadhyay:
Depth-4 Identity Testing and Noether's Normalization Lemma. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c12]Suryajith Chillara, Partha Mukhopadhyay:
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. MFCS (2) 2014: 177-188 - [c11]Suryajith Chillara, Partha Mukhopadhyay:
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach. STACS 2014: 239-250 - [i14]Suryajith Chillara, Partha Mukhopadhyay:
On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields. CoRR abs/1401.0189 (2014) - 2013
- [j6]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): 679-725 (2013) - [j5]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: 1 (2013) - [j4]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): 2114-2131 (2013) - [i13]Suryajith Chillara, Partha Mukhopadhyay:
Determinantal Complexity of Iterated Matrix Multiplication Polynomial. CoRR abs/1308.1640 (2013) - 2012
- [c10]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar:
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. LATIN 2012: 37-48 - [c9]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. MFCS 2012: 112-123 - [i12]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups. CoRR abs/1201.3181 (2012) - 2011
- [i11]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar:
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. Electron. Colloquium Comput. Complex. TR11 (2011) - [i10]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Expanding Generator Sets for Solvable Permutation Groups. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j3]Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan:
New Results on Noncommutative and Commutative Polynomial Identity Testing. Comput. Complex. 19(4): 521-558 (2010) - [j2]Vikraman Arvind, Partha Mukhopadhyay:
The ideal membership problem and polynomial identity testing. Inf. Comput. 208(4): 351-363 (2010) - [j1]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
Isomorphism and canonization of tournaments and hypertournaments. J. Comput. Syst. Sci. 76(7): 509-523 (2010) - [c8]Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka:
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. FOCS 2010: 695-704 - [c7]Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich:
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. STOC 2010: 649-658 - [i9]Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka:
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c6]Vikraman Arvind, Partha Mukhopadhyay:
Quantum Query Complexity of Multilinear Identity Testing. STACS 2009: 87-98 - [i8]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. TR09 (2009) - 2008
- [c5]Vikraman Arvind, Partha Mukhopadhyay:
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. APPROX-RANDOM 2008: 276-289 - [c4]Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan:
New Results on Noncommutative and Commutative Polynomial Identity Testing. CCC 2008: 268-279 - [i7]Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan:
New results on Noncommutative and Commutative Polynomial Identity Testing. CoRR abs/0801.0514 (2008) - [i6]Vikraman Arvind, Partha Mukhopadhyay:
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. CoRR abs/0804.0957 (2008) - [i5]Vikraman Arvind, Partha Mukhopadhyay:
Quantum Query Complexity of Multilinear Identity Testing. CoRR abs/0807.1412 (2008) - [i4]Vikraman Arvind, Partha Mukhopadhyay:
Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. Electron. Colloquium Comput. Complex. TR08 (2008) - [i3]Vikraman Arvind, Partha Mukhopadhyay:
Quantum Query Complexity of Multilinear Identity Testing. Electron. Colloquium Comput. Complex. TR08 (2008) - [i2]Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan:
New results on Noncommutative and Commutative Polynomial Identity Testing. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c3]Vikraman Arvind, Partha Mukhopadhyay:
The Monomial Ideal Membership Problem and Polynomial Identity Testing. ISAAC 2007: 800-811 - [i1]Vikraman Arvind, Partha Mukhopadhyay:
The Ideal Membership Problem and Polynomial Identity Testing. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c2]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
The Complexity of Black-Box Ring Problems. COCOON 2006: 126-135 - [c1]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
On Isomorphism and Canonization of Tournaments and Hypertournaments. ISAAC 2006: 449-459
Coauthor Index
[c28] [c27] [i41] [i40] [c26] [i38] [i37] [j14] [j13] [c25] [i36] [i35] [i34] [c22] [j12] [c20] [i31] [j9] [c19] [c18] [c17] [i28] [i27] [i26] [j8] [c16] [i25] [i24] [i23] [i22] [c15] [c14] [i21] [i20] [i19] [i18] [i17] [i16] [c10] [c9] [i12] [i11] [i10] [j3] [j2] [j1] [c6] [c5] [c4] [i7] [i6] [i5] [i4] [i3] [i2] [c3] [i1] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
