Vishwas Bhargava

Orcid: 0009-0005-7869-377X

Affiliations:
  • California Institute of Technology, Pasadena, USA


According to our database1, Vishwas Bhargava authored at least 14 papers between 2017 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Faster & Deterministic FPT Algorithm for Worst-Case Tensor Decomposition.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
The Complexity of Order-Finding for ROABPs.
CoRR, 2024

Explicit Commutative ROABPs from Partial Derivatives.
Proceedings of the 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2024

2023
Linear Independence, Alternants, and Applications.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Fast, algebraic multivariate multipoint evaluation in small characteristic and applications.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Fast Multivariate Multipoint Evaluation Over All Finite Fields.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Learning Generalized Depth Three Arithmetic Circuits in the Non-Degenerate Case.
Proceedings of the Approximation, 2022

2021
Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Improved Hitting Set for Orbit of ROABPs.
Proceedings of the Approximation, 2021

2020
Reconstruction of Depth-4 Multilinear Circuits.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Irreducibility and r-th root finding over finite fields.
CoRR, 2017

Irreducibility and Deterministic r-th Root Finding over Finite Fields.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017


  Loading...