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.[2] He is also author/editor of several books in mathematical logic and computer science.[3]
Buss proved in 1983 that the Boolean Formula Evaluation problem is in ALogTime, a major result in complexity theory.
3D Computer Graphics: A mathematical approach with OpenGL
January 01, 1970
samuel, buss, this, article, includes, list, general, references, lacks, sufficient, corresponding, inline, citations, please, help, improve, this, article, introducing, more, precise, citations, august, 2011, learn, when, remove, this, message, samuel, buss, . This article includes a list of general references but it lacks sufficient corresponding inline citations Please help to improve this article by introducing more precise citations August 2011 Learn how and when to remove this message Samuel R Sam Buss born August 6 1957 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 Samuel R BussAlma materPrinceton University Emory UniversityKnown forBounded arithmetic Boolean formula evaluationScientific careerFieldsComputer science mathematicsInstitutionsUniversity of California Berkeley University of California San DiegoThesisBounded arithmetic 1985 Doctoral advisorSimon KochenDoctoral studentsMaria Luisa Bonet Contents 1 Biography 2 Research 3 References 4 External linksBiography editBuss 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 a 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 In 2019 Buss gave the Godel Lecture titled Totality provability and feasibility Research editBuss 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 2 He is also author editor of several books in mathematical logic and computer science 3 Buss proved in 1983 that the 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 edit A Limit of First Order Logic Godel s Lost Letter and P NP Rjlipton wordpress com 17 January 2010 Retrieved 2012 07 09 Bounded Arithmetic Revision of 1985 Ph D Thesis PDF Publications and Other Research External links editHome page of Samuel R Buss The Boolean formula value problem is in ALOGTIME Bounded arithmetic Handbook of Proof Theory 3D Computer Graphics A mathematical approach with OpenGL Retrieved from https en wikipedia org w index php title Samuel Buss amp oldid 1207861610, wikipedia, wiki, book, books, library,
