default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPranjal Dutta
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Pranjal Dutta, Nitin Saxena, Thomas Thierauf:
Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply VP ≠q VNP. Comput. Complex. 33(1): 3 (2024)- [c16]Pranjal Dutta, Amit Sinhababu, Thomas Thierauf:
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors. APPROX/RANDOM 2024: 75:1-75:20 - [c15]Somnath Bhattacharjee, Markus Bläser, Pranjal Dutta, Saswata Mukherjee:
Exponential Lower Bounds via Exponential Sums. ICALP 2024: 24:1-24:20 - [c14]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov
:
Homogeneous Algebraic Complexity Theory and Algebraic Formulas. ITCS 2024: 43:1-43:23 - [c13]Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta, Arijit Ghosh, Swagato Sanyal:
On Fourier Analysis of Sparse Boolean Functions over Certain Abelian Groups. MFCS 2024: 40:1-40:16 - [c12]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Fixed-Parameter Debordering of Waring Rank. STACS 2024: 30:1-30:15 - [c11]Pranjal Dutta, Christian Ikenmeyer, Balagopal Komarath, Harshil Mittal, Saraswati Girish Nanoti, Dhara Thakkar:
On the Power of Border Width-2 ABPs over Fields of Characteristic 2. STACS 2024: 31:1-31:16 - [i18]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Fixed-parameter debordering of Waring rank. CoRR abs/2401.07631 (2024) - [i17]Sourav Chakraborty, Swarnalipa Datta, Pranjal Dutta, Arijit Ghosh, Swagato Sanyal:
On Fourier analysis of sparse Boolean functions over certain Abelian groups. CoRR abs/2406.18700 (2024) - [i16]Maxim van den Berg, Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Vladimir Lysikov:
Algebraic metacomplexity and representation theory. CoRR abs/2411.03444 (2024) - [i15]Pranjal Dutta, Amit Sinhababu, Thomas Thierauf:
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors. CoRR abs/2411.17330 (2024) - [i14]Vishwas Bhargava, Pranjal Dutta, Sumanta Ghosh, Anamay Tengse:
The Complexity of Order-Finding for ROABPs. CoRR abs/2411.18981 (2024) - [i13]Divesh Aggarwal, Pranjal Dutta, Zeyong Li, Maciej Obremski, Sidhant Saraogi:
Improved Lower Bounds for 3-Query Matching Vector Codes. Electron. Colloquium Comput. Complex. TR24 (2024) - [i12]Pranjal Dutta, Amit Sinhababu, Thomas Thierauf:
Derandomizing Multivariate Polynomial Factoring for Low Degree Factors. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c10]Pranjal Dutta, Mahesh Sreekumar Rajasree:
Efficient Reductions and Algorithms for Subset Product. CALDAM 2023: 3-14 - [c9]Pranjal Dutta, Mahesh Sreekumar Rajasree:
On the Variants of Subset Sum: Projected and Unbounded. SYNASC 2023: 86-93 - [i11]Pranjal Dutta, Prateek Dwivedi, Nitin Saxena:
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits. CoRR abs/2304.11325 (2023) - [i10]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Homogeneous Algebraic Complexity Theory and Algebraic Formulas. CoRR abs/2311.17019 (2023) - 2022
- [j1]Pranjal Dutta, Nitin Saxena, Amit Sinhababu:
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring. J. ACM 69(3): 18:1-18:39 (2022) - [c8]Pranjal Dutta, Mahesh Sreekumar Rajasree:
Algebraic Algorithms for Variants of Subset Sum. CALDAM 2022: 237-251 - [c7]Pranjal Dutta, Nitin Saxena:
Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits. FOCS 2022: 200-211 - [i9]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Border complexity via elementary symmetric polynomials. CoRR abs/2211.07055 (2022) - [i8]Pranjal Dutta, Fulvio Gesmundo, Christian Ikenmeyer, Gorav Jindal, Vladimir Lysikov:
Border complexity via elementary symmetric polynomials. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c6]Pranjal Dutta, Prateek Dwivedi, Nitin Saxena:
Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits. CCC 2021: 11:1-11:27 - [c5]Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
Arithmetic Circuit Complexity of Division and Truncation. CCC 2021: 25:1-25:36 - [c4]Pranjal Dutta:
Real τ-Conjecture for Sum-of-Squares: A Unified Approach to Lower Bound and Derandomization. CSR 2021: 78-101 - [c3]Pranjal Dutta, Prateek Dwivedi, Nitin Saxena:
Demystifying the border of depth-3 algebraic circuits. FOCS 2021: 92-103 - [c2]Pranjal Dutta, Nitin Saxena, Thomas Thierauf:
A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization. ITCS 2021: 23:1-23:21 - [i7]Pranjal Dutta, Mahesh Sreekumar Rajasree:
Efficient reductions and algorithms for variants of Subset Sum. CoRR abs/2112.11020 (2021) - [i6]Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
Arithmetic Circuit Complexity of Division and Truncation. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [i5]Pranjal Dutta, Nitin Saxena, Thomas Thierauf:
Lower bounds on the sum of 25th-powers of univariates lead to complete derandomization of PIT. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2018
- [c1]Pranjal Dutta, Nitin Saxena, Amit Sinhababu:
Discovering the roots: uniform closure results for algebraic classes under factoring. STOC 2018: 1152-1165 - 2017
- [i4]Pranjal Dutta, Nitin Saxena, Amit Sinhababu:
Discovering the roots: Uniform closure results for algebraic classes under factoring. CoRR abs/1710.03214 (2017) - [i3]Debojyoti Dey, Pranjal Dutta, Somenath Biswas:
A note on faithful coupling of Markov chains. CoRR abs/1710.10026 (2017) - [i2]Pranjal Dutta, Nitin Saxena, Amit Sinhababu:
Discovering the roots: Uniform closure results for algebraic classes under factoring. Electron. Colloquium Comput. Complex. TR17 (2017) - 2015
- [i1]Pranjal Dutta:
Modular Inversion Hidden Number Problem- A Lattice Approach. IACR Cryptol. ePrint Arch. 2015: 1140 (2015)
Coauthor Index
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-01-09 12:55 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:
