Skip to content

Efficient Verification of Computation with Yael Tauman Kalai

Photo of ACM
Hosted By
ACM
Efficient Verification of Computation with Yael Tauman Kalai

Details

Please join our good friends at ACM Boston for a talk with Yael Tauman Kalai, ACM Prize in Computing 2022 Recipient.

Efficient verification of computation is fundamental to computer science and is at the heart of the P vs. NP question. Recently it has had growing practical significance, especially with the increasing popularity of blockchain technologies and cloud computing. In this talk, I will present schemes for verifying the correctness of a computation. I will discuss both their practical aspects and their impact on quantum complexity, hardness of approximation, and the complexity of Nash equilibrium.

Note: You must register with Zoom before the live remote broadcast. After RSVP'ing on Meetup the Zoom link will become available.

This is a joint meeting of the GBC/ACM and the Boston Chapter of the IEEE-CS.

Photo of ACM Pittsburgh group
ACM Pittsburgh
See more events