Lukás Folwarczný is a PhD student of Theoretical Computer Science at Computer Science Institute of Charles University in Prague and Institute of Mathematics of the Czech Academy of Sciences. His advisor is Pavel Pudlák. Lukás is interested in computational complexity, proof complexity, and algorithms.
- Satisfiability: Theory, Practice, and Beyond, Spring 2021. Visiting Graduate Student.