受强制性开放获取政策约束的文章 - Ran Raz了解详情
可在其他位置公开访问的文章：21 篇
How to delegate computations: the power of no-signaling proofs
YT Kalai, R Raz, RD Rothblum
ACM Journal of the ACM (JACM) 69 (1), 1-82, 2021
强制性开放获取政策： US National Science Foundation, Federal Ministry of Education and Research …
Oracle separation of BQP and PH
R Raz, A Tal
ACM Journal of the ACM (JACM) 69 (4), 1-21, 2022
强制性开放获取政策： US National Science Foundation
Fast learning requires good memory: A time-space lower bound for parity learning
R Raz
Journal of the ACM (JACM) 66 (1), 1-18, 2018
强制性开放获取政策： US National Science Foundation
A time-space lower bound for a large class of learning problems
R Raz
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
强制性开放获取政策： US National Science Foundation
Extractor-based time-space lower bounds for learning
S Garg, R Raz, A Tal
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
强制性开放获取政策： US National Science Foundation
Time-space hardness of learning sparse parities
G Kol, R Raz, A Tal
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017
强制性开放获取政策： US National Science Foundation
Efficient multiparty protocols via log-depth threshold formulae
G Cohen, IB Damgård, Y Ishai, J Kölker, PB Miltersen, R Raz, ...
Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013
强制性开放获取政策： Danish Council for Independent Research, Danish National Research Foundation …
Near-quadratic lower bounds for two-pass graph streaming algorithms
S Assadi, R Raz
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
强制性开放获取政策： US National Science Foundation
Exponential separation of communication and external information
A Ganor, G Kol, R Raz
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016
强制性开放获取政策： US National Science Foundation
Time-space lower bounds for two-pass learning
S Garg, R Raz, A Tal
34th Computational Complexity Conference (CCC), 2019
强制性开放获取政策： US National Science Foundation
A lower bound for adaptively-secure collective coin flipping protocols
YT Kalai, I Komargodski, R Raz
Combinatorica 41 (1), 75-98, 2021
强制性开放获取政策： US National Science Foundation
Quantum versus randomized communication complexity, with efficient players
U Girish, R Raz, A Tal
computational complexity 31 (2), 17, 2022
强制性开放获取政策： US National Science Foundation
On the space complexity of linear programming with preprocessing
Y Tauman Kalai, R Raz, O Regev
Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016
强制性开放获取政策： US National Science Foundation
Certified hardness vs. randomness for log-space
E Pyne, R Raz, W Zhan
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
强制性开放获取政策： US National Science Foundation
Memory-sample lower bounds for learning with classical-quantum hybrid memory
Q Liu, R Raz, W Zhan
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1097-1110, 2023
强制性开放获取政策： US National Science Foundation, US Department of Defense
Parallel repetition for all 3-player games over binary alphabet
U Girish, J Holmgren, K Mittal, R Raz, W Zhan
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
强制性开放获取政策： US National Science Foundation
Is untrusted randomness helpful?
U Girish, R Raz, W Zhan
14th Innovations in Theoretical Computer Science Conference (ITCS 2023), 2023
强制性开放获取政策： US National Science Foundation
A candidate for a strong separation of information and communication
M Braverman, A Ganor, G Kol, R Raz
9th Innovations in Theoretical Computer Science Conference (ITCS 2018), 2018
强制性开放获取政策： US National Science Foundation
The random-query model and the memory-bounded coupon collector
R Raz, W Zhan
Innovations in Theoretical Computer Science Conference (ITCS 2020), 2020
强制性开放获取政策： US National Science Foundation
Quantum Logspace Computations are Verifiable
U Girish, R Raz, W Zhan
2024 Symposium on Simplicity in Algorithms (SOSA), 144-150, 2024
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定