Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Kiyoshi Yoshimoto
Tidjani Négadi
Daniel P. Kennedy
chaima hihoud
Barbara Aquilani
Shima Okada
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Home
/
Author
/
NIKHIL VYAS
Author Info
Open Visualization
Name
Affiliation
Papers
NIKHIL VYAS
Indian Inst Technol, Dept Comp Sci & Engn, Mumbai, Maharashtra, India
14
Collaborators
Citations
PageRank
15
3
4.79
Referers
Referees
References
7
47
30
Publications (14 rows)
Collaborators (15 rows)
Referers (7 rows)
Referees (47 rows)
Title
Citations
PageRank
Year
Optimal Fine-grained Hardness of Approximation of Linear Equations
0
0.34
2021
Results On A Super Strong Exponential Time Hypothesis
0
0.34
2020
Algorithms and Lower Bounds for Cycles and Walks - Small Space and Sparse Graphs.
0
0.34
2020
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits - Expanding the Reach of #SAT Algorithms.
0
0.34
2020
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem.
0
0.34
2020
Efficient Constructions for Almost-everywhere Secure Computation.
0
0.34
2019
Imperfect Gaps in Gap-ETH and PCPs.
0
0.34
2019
On Super Strong ETH.
0
0.34
2019
Thwarting Adversarial Examples - An L_0-Robust Sparse Fourier Transform.
0
0.34
2018
Thwarting Adversarial Examples: An L0-RobustSparse Fourier Transform.
0
0.34
2018
Distribution-based objectives for Markov Decision Processes.
0
0.34
2018
Super Strong ETH is False for Random k-SAT.
0
0.34
2018
Complexity of Restricted Variants of Skolem and Related Problems.
1
0.35
2017
Regularity of Unary Probabilistic Automata
2
0.38
2016
1