Explore >> Select a destination
|
You are here 
|
cstheory-events.org | ||
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | Complexity theorist Luca Trevisan lost his battle to cancer yesterday in Milan at the age of 52. A terrible loss for our community and our... | |
| | | | |
simons.berkeley.edu
|
|
| | | | | This workshop will focus on quantum interactive proofs and entangled quantum games. It will include recent advances in our understanding of the complexity class QMIP of multiple entangled provers, as well as QPIP, quantum polynomial time bounded provers. The workshop will also address quantum PCP from an interactive proof perspective. Enquiries may be sent to the organizers workshop_qhc1 [at] lists.simons.berkeley.edu (at this address.) | |
| | | | |
windowsontheory.org
|
|
| | | | | The following events will take place to honor our dear colleague and friend Luca Trevisan, that our community lost this June. RANDOM-APPROX 2024 will include a session in memory of Luca Trevisan consisting of a few short talks highlighting Luca's contributions to pseudorandomness and hardness of approximation, organized by Noga Ron-Zewi and Dieter van Melkebeek.... | |
| | | | |
fa.bianp.net
|
|
| | | The Langevin algorithm is a simple and powerful method to sample from a probability distribution. It's a key ingredient of some machine learning methods such as diffusion models and differentially private learning. In this post, I'll derive a simple convergence analysis of this method in the special case when the ... | ||
