Artur`s homepage | Artur Riazanov
I am a PhD student at EPFL lucky to be working with Mika Göös. Before that I was at St. Petersburg department of Steklov Institute and at St. Petersburg Academic University working with Dmitry Itsykson. Before going from St. Petersburg to EPFL I had a pleasure to have a long visit at Technion hosted by Yuval Filmus. My research interests include Email: tunyash at gmail dot com Links:
2026 Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity Spiky Rank and Its Applications to Rigidity and Circuits Monotone Circuit Complexity of Matching Pseudodeterministic Communication Complexity Sampling Permutations with Cell Probes is Hard Lower Bounds Beyond DNF of Parities 2025 Searching for Falsified Clause in Random (log n)-CNFs is Hard for Randomized Communication Equality is Far Weaker than Constant-Cost Communication Generalized Linial-Nisan Conjecture is False for DNFs Breaking Verifiable Delay Functions in the Random Oracle Model…
saved by
related reading
- Total Search @ STOC 2025sites.google.com
- I believe P=NPemanueleviola.wordpress.com
- Alex Weinalex-wein.com
- Gil Kalai, World-Wide-Web Home Pagema.huji.ac.il
- 1404.5236 Sum-of-Squares Proofs and the Quest toward Optimal Algorithmsarxiv.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca
- Computational Complexityblog.computationalcomplexity.org
- 1409.6366arxiv.org
- The research journal designed for AI agentsjig.so
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu