default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnamay Tengse
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i19]Prerona Chatterjee, Anamay Tengse:
Lower Bounds from Succinct Hitting Sets. Electron. Colloquium Comput. Complex. TR25: Article TR25-062 (2025)- 2024
- [j2]Prerona Chatterjee
, Kshitij Gajjar, Anamay Tengse:
Monotone classes beyond VNP. Theor. Comput. Sci. 1009: 114689 (2024) - [c7]Vishwas Bhargava, Anamay Tengse:
Explicit Commutative ROABPs from Partial Derivatives. FSTTCS 2024: 10:1-10:15 - [i18]Vishwas Bhargava, Anamay Tengse:
Explicit Commutative ROABPs from Partial Derivatives. CoRR abs/2407.10143 (2024) - [i17]Vishwas Bhargava, Pranjal Dutta, Sumanta Ghosh, Anamay Tengse:
The Complexity of Order-Finding for ROABPs. CoRR abs/2411.18981 (2024) - [i16]Vishwas Bhargava, Anamay Tengse:
Explicit Commutative ROABPs from Partial Derivatives. Electron. Colloquium Comput. Complex. TR24: Article TR24-119 (2024) - 2023
- [j1]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models. Theory Comput. 19: 1-30 (2023) - [c6]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Monotone Classes Beyond VNP. FSTTCS 2023: 11:1-11:23 - [i15]Prerona Chatterjee, Anamay Tengse:
On Annihilators of Explicit Polynomial Maps. CoRR abs/2309.07612 (2023) - [i14]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Monotone Classes Beyond VNP. Electron. Colloquium Comput. Complex. TR23: Article TR23-150 (2023) - [i13]Prerona Chatterjee, Anamay Tengse:
On Annihilators of Explicit Polynomial Maps. Electron. Colloquium Comput. Complex. TR23: Article TR23-135 (2023) - 2022
- [c5]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP Is Hard, Then so Are Equations for It. STACS 2022: 44:1-44:13 - [c4]C. Ramya, Anamay Tengse:
On Finer Separations Between Subclasses of Read-Once Oblivious ABPs. STACS 2022: 53:1-53:23 - [i12]C. Ramya, Anamay Tengse:
On Finer Separations between Subclasses of Read-once Oblivious ABPs. CoRR abs/2201.06432 (2022) - [i11]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Transparency Beyond VNP in the Monotone Setting. CoRR abs/2202.13103 (2022) - [i10]Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Transparency Beyond VNP in the Monotone Setting. Electron. Colloquium Comput. Complex. TR22: Article TR22-031 (2022) - [i9]C. Ramya, Anamay Tengse:
On Finer Separations between Subclasses of Read-once Oblivious ABPs. Electron. Colloquium Comput. Complex. TR22: Article TR22-009 (2022) - 2020
- [c3]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. FOCS 2020: 870-880 - [i8]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. CoRR abs/2004.14147 (2020) - [i7]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP is hard, then so are equations for it. CoRR abs/2012.07056 (2020) - [i6]Prerona Chatterjee, Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
On the Existence of Algebraically Natural Proofs. Electron. Colloquium Comput. Complex. TR20: Article TR20-063 (2020) - [i5]Mrinal Kumar, C. Ramya, Ramprasad Saptharishi, Anamay Tengse:
If VNP is hard, then so are equations for it. Electron. Colloquium Comput. Complex. TR20: Article TR20-187 (2020)
2010 – 2019
- 2019
- [c2]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. SODA 2019: 639-646 - 2018
- [c1]Ramprasad Saptharishi, Anamay Tengse:
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees. FSTTCS 2018: 6:1-6:19 - [i4]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. CoRR abs/1807.06323 (2018) - [i3]Mrinal Kumar, Ramprasad Saptharishi, Anamay Tengse:
Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. Electron. Colloquium Comput. Complex. TR18: Article TR18-132 (2018) - 2017
- [i2]Ramprasad Saptharishi, Anamay Tengse:
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees. CoRR abs/1709.03068 (2017) - [i1]Ramprasad Saptharishi, Anamay Tengse:
Quasi-polynomial Hitting Sets for Circuits with Restricted Parse Trees. Electron. Colloquium Comput. Complex. TR17: Article TR17-135 (2017)
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-07-05 02:40 CEST 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:
