关注
Dhiraj Holden
Dhiraj Holden
Graduate Student, MIT
在 mit.edu 的电子邮件经过验证
标题
引用次数
引用次数
年份
On the power of statistical zero knowledge
A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
SIAM Journal on Computing 49 (4), FOCS17-1-FOCS17-58, 2019
452019
Characterization of BshA, bacillithiol glycosyltransferase from Staphylococcus aureus and Bacillus subtilis
H Upton, GL Newton, M Gushiken, K Lo, D Holden, RC Fahey, M Rawat
FEBS letters 586 (7), 1004-1008, 2012
292012
The minimum oracle circuit size problem
E Allender, D Holden, V Kabanets
Computational Complexity 26, 469-496, 2017
282017
Pseudo-deterministic proofs
S Goldwasser, O Grossman, D Holden
arXiv preprint arXiv:1706.04641, 2017
272017
The minimum oracle circuit size problem
E Allender, D Holden, V Kabanets
32nd International Symposium on Theoretical Aspects of Computer Science …, 2015
212015
Fast algorithmic self-assembly of simple shapes using random agitation
HL Chen, D Doty, D Holden, C Thachuk, D Woods, CT Yang
DNA Computing and Molecular Programming: 20th International Conference, DNA …, 2014
202014
A note on unconditional subexponential-time pseudo-deterministic algorithms for BPP search problems
D Holden
arXiv preprint arXiv:1707.05808, 2017
112017
The complexity of problems in p given correlated instances
S Goldwasser, D Holden
72017
Doubly-efficient pseudo-deterministic proofs
M Goemans, S Goldwasser, D Holden
arXiv preprint arXiv:1910.00994, 2019
62019
On szk and pp
A Bouland, L Chen, D Holden, J Thaler, PN Vasudevan
arXiv preprint arXiv:1609.02888, 2016
42016
Non-signaling proofs with o (√ log n) provers are in PSPACE
D Holden, YT Kalai
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
32020
On the fine grained complexity of polynomial time problems given correlated instances
S Goldwasser, D Holden
Innovations in Theoretical Computer Science (ITCS), 2016
32016
8th Innovations in Theoretical Computer Science Conference (ITCS 2017)
JR Lee, I Panageas, G Piliouras, Z Allen-Zhu, L Orecchia, T Kaufman, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2017
22017
Results on the 3x+ 1 and 3x+ d conjectures
D HOLDEN
Dhiraj. pdf, 0
1
Modern Interactive Proofs
D Holden
Massachusetts Institute of Technology, 2022
2022
Non-Signaling Proofs with Provers are in PSPACE
D Holden, Y Kalai
arXiv preprint arXiv:1910.02590, 2019
2019
Solving problems in P using correlated instances
D Holden
Massachusetts Institute of Technology, 2017
2017
1 Grothendieck’s Inequality
AM Scribe, D Holden
系统目前无法执行此操作,请稍后再试。
文章 1–18