Sam Buss is a Professor of Mathematics and Computer Science at the University of California, San Diego. He received his PhD from Princeton University in 1985. Buss's primary research interests are in bounded arithmetic, propositional proof complexity and computational complexity. Bounded arithmetic and propositional proof complexity address the foundations of computational complexity from the viewpoint of provability. The goal is to use mathematical logic to obtain a better understanding of the central open questions in computational complexity. Buss has also worked in computer graphics and computational physics, and is the author of two books, Bounded Arithmetic, and a textbook on computer graphics.
- Logical Structures in Computation, Fall 2016. Visiting Scientist.