Jump to content

Samuel Buss

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Cydebot (talk | contribs) at 21:58, 2 May 2016 (Robot - Speedily moving category Princeton University alumni, 1980–1989 to Category:Princeton University alumni, 1980–89 per CFDS.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Samuel R. Buss
Alma materPrinceton University
Emory University
Known forBounded Arithmetic
Boolean Formula Evaluation
Scientific career
FieldsComputer Science, Mathematics
InstitutionsUniversity of California, Berkeley, University of California, San Diego
Doctoral advisorSimon Kochen

Samuel R. Buss (a.k.a. Sam Buss) is an American computer scientist and mathematician who has made major contributions to the fields of mathematical logic, complexity theory and proof complexity. He is currently a Professor at the University of California, San Diego, Department of Computer Science and Department of Mathematics.

Biography

Buss received his Bachelor's degree in 1979 from the Emory University, and his Master's degree and Ph.D. from Princeton University, respectively in 1983 and 1985. He joined the University of California, Berkeley, mathematics department in 1986 as an Lecturer, and stayed there until 1988. Buss joined the faculty of University of California, San Diego, Computer Science and Mathematics Departments in 1988 as an Assistant Professor, where he was promoted to Professor in 1993.

Research

Buss is considered one of the forefathers of bounded arithmetic and proof complexity.[1]

During his PhD, Buss worked in bounded arithmetic. He received his PhD in 1985. He introduced bounded arithmetic in his thesis and gave a nice proof theoretic characterization of polynomial time computation. His thesis is one of the main references in the area of bounded arithmetic.[citation needed] His is also author/editor of several books in mathematical logic and computer science.[2]

Buss proved in 1983 that Boolean Formula Evaluation problem is in ALogTime, a major result in complexity theory.

His main research areas are mathematical logic, complexity theory and proof complexity. Other areas which he has contributed to include bounded arithmetic, bounded reverse mathematics, and lower bounds in propositional proof systems.

References

  1. ^ "A Limit of First Order Logic « Gödel's Lost Letter and P=NP". Rjlipton.wordpress.com. Retrieved 2012-07-09.
  2. ^ http://math.ucsd.edu/~sbuss/ResearchWeb/index.html

Template:Persondata

Retrieved from "https://en.wikipedia.org/w/index.php?title=Samuel_Buss&oldid=718331047"