{"id":28,"date":"2024-09-20T20:19:47","date_gmt":"2024-09-20T20:19:47","guid":{"rendered":"https:\/\/homes.cs.washington.edu\/~beame\/site\/?page_id=28"},"modified":"2025-01-07T23:10:27","modified_gmt":"2025-01-07T23:10:27","slug":"bio","status":"publish","type":"page","link":"https:\/\/homes.cs.washington.edu\/~beame\/site\/bio\/","title":{"rendered":"Biography"},"content":{"rendered":"\n<p>Paul received his B.Sc. in Mathematics in 1981, an M.Sc. in Computer Science in 1982, and Ph.D. in Computer Science in 1987, all from the&nbsp;<a href=\"http:\/\/www.cs.utoronto.ca\/\">University of Toronto<\/a>. He was a Post-doctoral Research Associate at M.I.T. for the 1986-87 academic year and joined the University of Washington in 1987.<\/p>\n\n\n\n<p>Paul&#8217;s research is in pure and applied computational complexity. A major focus of his research is in proving lower bounds on the resources needed for solving computational problems. Such topics include\u00a0<a href=\"https:\/\/www.cs.washington.edu\/people\/faculty\/beame\/publications-by-topic#beame-commstream\">communication complexity<\/a>,\u00a0<a href=\"https:\/\/www.cs.washington.edu\/people\/faculty\/beame\/publications-by-topic#beame-tradeoff\">time-space tradeoff lower bounds<\/a>,\u00a0<a href=\"https:\/\/www.cs.washington.edu\/people\/faculty\/beame\/publications-by-topic#beame-circuit\">circuit complexity<\/a>,\u00a0<a href=\"https:\/\/www.cs.washington.edu\/people\/faculty\/beame\/publications-by-topic#beame-proofsat\">proof complexity<\/a>, and\u00a0<a href=\"https:\/\/www.cs.washington.edu\/people\/faculty\/beame\/publications-by-topic#beame-data\">data structures<\/a>, as well as <a href=\"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649700\" data-type=\"link\" data-id=\"https:\/\/dl.acm.org\/doi\/10.1145\/3618260.3649700\">limitations of space-bounded quantum computers<\/a>.  Another focus of his research is on\u00a0<a href=\"https:\/\/www.cs.washington.edu\/people\/faculty\/beame\/publications-by-topic#beame-proofsat\">problems related to formal reasoning, including SAT-solving<\/a>. His research includes applications of computational complexity in formal verification of software and hardware (such as\u00a0<a href=\"https:\/\/www.cs.washington.edu\/node\/14419\">verifying non-linear arithmetic<\/a>), in the study of databases, and in AI, particularly in knowledge representation, learning, and probabilistic inference.  <\/p>\n","protected":false},"excerpt":{"rendered":"<p>Paul received his B.Sc. in Mathematics in 1981, an M.Sc. in Computer Science in 1982, and Ph.D. in Computer Science in 1987, all from the&nbsp;University of Toronto. He was a Post-doctoral Research Associate at M.I.T. for the 1986-87 academic year and joined the University of Washington in 1987. Paul&#8217;s research is in pure and applied [&hellip;]<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":1,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-28","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/pages\/28","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/comments?post=28"}],"version-history":[{"count":8,"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/pages\/28\/revisions"}],"predecessor-version":[{"id":181,"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/pages\/28\/revisions\/181"}],"wp:attachment":[{"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/media?parent=28"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}