Talks

• Varför är beräkningsproblem svåra. (in Swedish) Given at the Göran Gustafsson prize award cermony in May 2000.
• On efficient of NP-hard optimization problems. Given at the AMS-Scandinavian Congress, June 2000.
• On efficient of NP-hard optimization problems. Given at ICALP, July 2000.
• On the standard written proofs. Given at Theory Day, New York, March 2001.
• On the bitsecurity of RSA. Given at FPSAC conference in Vadstena in June 2003.
• Inapproximability, some history and some open problems. Given at Computational Complexity conference in Aarhus in July 2003.
• Finns det säkra kryptosystem? (Swedish) Given at KVAs lärardag, Piteå, October 2003. Also available as pdf
• Approximability and efficient proofs Given at European Congress of mathematicians, July 2004. Also available as pdf
• Kryptering och primtalsfaktorisering (Swedish) Given at KTH day for teachers of mathematics, November 2004. Also available as pdf
• Psuedorandomness (Swedish) Given at department of mathematics at Uppsala, December 2004. Also available as pdf
• Efficient primality (Swedish) Given at Royal Academy of Sciences, March 2005. Also available as pdf
• Every 2-CSP allows nontrivial approximation Given at STOC 2005. Also available as pdf
• Randomness and proofs Given at RSA conference 2005.
• On the approximability of Contstraint Satisfaction Problems presentation at ETH, May 2006.
• Multiplikation av stora heltal (Swedish) Matematiska cirkeln, KTH, september 2006. Finns även som pdf.
• On nontrivial approximation of CSPs Invited presentation at Approx 2006.
• Konsten att multiplicera (stora) heltal (Swedish) Sonja Kovalevsky dagarna, november 2006.
• Solving systems of linear equations over finite fields Svenska matematikersamfundets årsmöte, June 2007.
• On the efficient approximability of constraint satisfaction problems Invited presentation at British Combinatorics Conference, July 2007.
• On the Approximation Resistance of a Random Predicate Presentation at Approx 2007.