Ngoc Khanh Nguyen, Towards Fast Verification: Polynomial Commitments from Lattices
ฝัง
- เผยแพร่เมื่อ 8 พ.ย. 2024
- This talk was recorded as part of a workshop hosted by ICMS. For more of our talk recordings have a look at the other event playlists on our TH-cam channel or take a look on our Media Hopper channel for lots of other workshops
media.ed.ac.uk...
Head to the ICMS website for news and information about upcoming workshops and events www.icms.org.uk/ Subtitles have been generated automatically and the following disclaimer should be added to all recordings Please note that the subtitles that accompany this recording are auto-generated by TH-cam. ICMS is happy to correct any errors, please email info@icms.org.uk with the details.