E-LIB Suche - Ergebnisse für: Saptharishi, Ramprasad

1

Constructing Faithful Homomorphisms over Fields of Finite C..:

Chatterjee, Prerona ; Saptharishi, Ramprasad
ACM Transactions on Computation Theory. 15 (2023) 1-2 - p. 1-19 , 2023

Link: https://doi.org/10.1145/..

2

Fast Numerical Multivariate Multipoint Evaluation:

, In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS),

Ghosh, Sumanta ; Harsha, Prahladh ; Herdade, Simao.. - p. 1426-1439 , 2023

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

3

Derandomization from Algebraic Hardness:

Guo, Zeyu ; Kumar, Mrinal ; Saptharishi, Ramprasad.
SIAM Journal on Computing. 51 (2022) 2 - p. 315-335 , 2022

Link: https://doi.org/10.1137/..

4

Vanishing spaces of random sets and applications to Reed-Mu..:

, In: Proceedings of the 37th Computational Complexity Conference,

Bhandari, Siddharth ; Harsha, Prahladh ; Saptharishi, Ramprasad. - p. 1-14 , 2022

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

5

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/..

6

City-Scale Agent-Based Simulators for the Study of Non-phar..:

Agrawal, Shubhada ; Bhandari, Siddharth ; Bhattacharjee, Anirban...
Journal of the Indian Institute of Science. 100 (2020) 4 - p. 809-847 , 2020

Link: https://doi.org/10.1007/..

7

The Computational Power of Depth Five Arithmetic Circuits:

Kumar, Mrinal ; Saptharishi, Ramprasad
SIAM Journal on Computing. 48 (2019) 1 - p. 144-180 , 2019

Link: https://doi.org/10.1137/..

8

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..

9

Derandomization from Algebraic Hardness: Treading the Borde..:

, In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS),

Guo, Zeyu ; Kumar, Mrinal ; Saptharishi, Ramprasad. - p. 147-157 , 2019

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

10

Identity Testing and Lower Bounds for Read-kOblivious Algeb..:

Anderson, Matthew ; Forbes, Michael A. ; Saptharishi, Ramprasad..
ACM Transactions on Computation Theory. 10 (2018) 1 - p. 1-30 , 2018

Link: https://doi.org/10.1145/..

11

Identity Testing and Lower Bounds for Read-k Oblivious Alge..:

Anderson, Matthew ; Forbes, Michael A. ; Saptharishi, Ramprasad..
ACM Transactions on Computation Theory (TOCT). 10 (2018) 1 - p. 1-30 , 2018

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

12

Unexpected power of low-depth arithmetic circuits:

Gupta, Ankit ; Kamath, Pritish ; Kayal, Neeraj.
Communications of the ACM. 60 (2017) 6 - p. 93-100 , 2017

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

13

Unexpected power of low-depth arithmetic circuits:

Gupta, Ankit ; Kamath, Pritish ; Kayal, Neeraj.
Communications of the ACM. 60 (2017) 6 - p. 93-100 , 2017

Link: https://doi.org/10.1145/..

14

An exponential lower bound for homogeneous depth-5 circuits..:

, In: Proceedings of the 32nd Computational Complexity Conference,

Kumar, Mrinal ; Saptharishi, Ramprasad - p. 1-30 , 2017

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

15

Efficiently decoding Reed-Muller codes from random errors:

, In: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing,

Saptharishi, Ramprasad ; Shpilka, Amir ; Volk, Ben Lee - p. 227-235 , 2016

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