受强制性开放获取政策约束的文章 - Nikhil Vyas了解详情
可在其他位置公开访问的文章：16 篇
On provable copyright protection for generative models
N Vyas, SM Kakade, B Barak
International Conference on Machine Learning, 35277-35299, 2023
强制性开放获取政策： US National Science Foundation, US Department of Energy, US Department of …
Thwarting Adversarial Examples: An -Robust Sparse Fourier Transform
M Bafna, J Murtagh, N Vyas
Advances in Neural Information Processing Systems 31, 10075-10085, 2018
强制性开放获取政策： US National Science Foundation
Faster Space-Efficient Algorithms for Subset Sum, -Sum, and Related Problems
N Bansal, S Garg, J Nederlof, N Vyas
SIAM Journal on Computing 47 (5), 1755-1777, 2018
强制性开放获取政策： Netherlands Organisation for Scientific Research, European Commission
Limitations of the NTK for Understanding Generalization in Deep Learning
N Vyas, Y Bansal, P Nakkiran
arXiv preprint arXiv:2206.10012, 2022
强制性开放获取政策： US National Science Foundation, US Department of Energy
Feature-learning networks are consistent across widths at realistic scales
N Vyas, A Atanasov, B Bordelon, D Morwani, S Sainathan, C Pehlevan
Advances in Neural Information Processing Systems 36, 2024
强制性开放获取政策： Chan Zuckerberg Initiative
On super strong ETH
N Vyas, R Williams
Journal of Artificial Intelligence Research 70, 473-495, 2021
强制性开放获取政策： US National Science Foundation
Fast Low-Space Algorithms for Subset Sum
C Jin, N Vyas, R Williams
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
强制性开放获取政策： US National Science Foundation
Distribution-based objectives for Markov Decision Processes
S Akshay, B Genest, N Vyas
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer …, 2018
强制性开放获取政策： US National Science Foundation, Department of Science & Technology, India
Complexity of Restricted Variants of Skolem and Related Problems
S Akshay, N Balaji, N Vyas
LIPIcs-Leibniz International Proceedings in Informatics 83, 2017
强制性开放获取政策： German Research Foundation
Lower bounds against sparse symmetric functions of ACC circuits: Expanding the reach of# SAT algorithms
N Vyas, RR Williams
Theory of Computing Systems 67 (1), 149-177, 2023
强制性开放获取政策： US National Science Foundation
Multi-structural games and number of quantifiers
R Fagin, J Lenchner, KW Regan, N Vyas
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021
强制性开放获取政策： US National Science Foundation
Near-Optimal Complexity Bounds for Fragments of the Skolem Problem
S Akshay, N Balaji, A Murhekar, R Varma, N Vyas
37th International Symposium on Theoretical Aspects of Computer Science …, 2020
强制性开放获取政策： US National Science Foundation, Department of Science & Technology, India
On Regularity of unary Probabilistic Automata
S Akshay, B Genest, B Karelovic, N Vyas
STACS 2016, 2016
强制性开放获取政策： Department of Science & Technology, India
Efficient constructions for almost-everywhere secure computation
S Jayanti, S Raghuraman, N Vyas
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
强制性开放获取政策： US Department of Defense
Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs
A Lincoln, N Vyas
11th Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
强制性开放获取政策： US National Science Foundation
On oracles and algorithmic methods for proving lower bounds
N Vyas, R Williams
14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定