E-LIB Suche - Ergebnisse für: Tengse, Anamay

1

Monotone classes beyond VNP:

Chatterjee, Prerona ; Gajjar, Kshitij ; Tengse, Anamay
Theoretical Computer Science. 1009 (2024) - p. 114689 , 2024

Link: https://doi.org/10.1016/..

2

On the Existence of Algebraically Natural Proofs:

, In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS),

Chatterjee, Prerona ; Kumar, Mrinal ; Ramya, C.. - p. 870-880 , 2020

Link: https://doi.org/10.1109/..

3

Near-optimal bootstrapping of hitting sets for algebraic ci..:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,

Kumar, Mrinal ; Saptharishi, Ramprasad ; Tengse, Anamay - p. 639-646 , 2019

Link: https://dl.acm.org/doi/1..

4

Chatterjee, Prerona ; Gajjar, Kshitij ; Tengse, Anamay
Is Part Of LIPIcs, Volume 284, 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023). , 2023

Link: https://doi.org/10.4230/..

5

On Annihilators of Explicit Polynomial Maps:

Chatterjee, Prerona ; Tengse, Anamay
http://arxiv.org/abs/2309.07612. , 2023

Link: http://arxiv.org/abs/230..

6

If VNP Is Hard, Then so Are Equations for It:

Kumar, Mrinal ; Ramya, C ; Saptharishi, Ramprasad.
doi:10.4230/LIPIcs.STACS.2022.44. , 2022

Link: https://doi.org/10.4230/..

7

Monotone Classes Beyond VNP:

Chatterjee, Prerona ; Gajjar, Kshitij ; Tengse, Anamay
http://arxiv.org/abs/2202.13103. , 2022

Link: http://arxiv.org/abs/220..

8

On Finer Separations Between Subclasses of Read-Once Oblivi..:

Ramya, C ; Tengse, Anamay
doi:10.4230/LIPIcs.STACS.2022.53. , 2022

Link: https://doi.org/10.4230/..

9

On Finer Separations between Subclasses of Read-once Oblivi..:

Ramya, C ; Tengse, Anamay
http://arxiv.org/abs/2201.06432. , 2022

Link: http://arxiv.org/abs/220..

10

On the Existence of Algebraically Natural Proofs:

Chatterjee, Prerona ; Kumar, Mrinal ; Ramya, C..
http://arxiv.org/abs/2004.14147. , 2020

Link: http://arxiv.org/abs/200..

11

If VNP is hard, then so are equations for it:

Kumar, Mrinal ; Ramya, C ; Saptharishi, Ramprasad.
http://arxiv.org/abs/2012.07056. , 2020

Link: http://arxiv.org/abs/201..

12

Quasipolynomial Hitting Sets for Circuits with Restricted P..:

Saptharishi, Ramprasad ; Tengse, Anamay
doi:10.4230/LIPIcs.FSTTCS.2018.6. , 2018

Link: https://doi.org/10.4230/..

13

Near-optimal Bootstrapping of Hitting Sets for Algebraic Mo..:

Kumar, Mrinal ; Saptharishi, Ramprasad ; Tengse, Anamay
http://arxiv.org/abs/1807.06323. , 2018

Link: http://arxiv.org/abs/180..

14

Quasi-polynomial Hitting Sets for Circuits with Restricted ..:

Saptharishi, Ramprasad ; Tengse, Anamay
http://arxiv.org/abs/1709.03068. , 2017

Link: http://arxiv.org/abs/170..