{"id":32,"date":"2024-09-20T20:22:31","date_gmt":"2024-09-20T20:22:31","guid":{"rendered":"https:\/\/homes.cs.washington.edu\/~beame\/site\/?page_id=32"},"modified":"2024-09-20T20:22:48","modified_gmt":"2024-09-20T20:22:48","slug":"talks","status":"publish","type":"page","link":"https:\/\/homes.cs.washington.edu\/~beame\/site\/talks\/","title":{"rendered":"Talks"},"content":{"rendered":"\n<ul class=\"wp-block-list\">\n<li>Lower Bounds, EPIT 2023 : Le Kal\u00e9idoscope de la Complexit\u00e9, Ile d&#8217;Ol\u00e9ron, June 2023.\n<ul class=\"wp-block-list\">\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/CircuitComplexity-EPIT.pptx\">Circuit Complexity<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/ProofComplexity-EPIT.pptx\">Proof Complexity<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/CommunicationComplexity-EPIT.pptx\">Communication Complexity<\/a><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/Proof-Complexity-Survey-BIRS-2020.pptx\">Proof Complexity 2020: A Survey<\/a>, BIRS Workshop on Proof Complexity, January 2020.<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/The-Limits-of-Proof.pptx\">The Limits of Proof<\/a>, Simons Institute for Theoretical Computer Science Open Lecture, November 2018.<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/SwitchingLemmas.pptx\">Switching Lemmas and Proof Complexity<\/a>, Dagstuhl Workshop on Proof Complexity, January 2018.<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/KnowledgeCompilationLowerBounds.pptx\">Knowledge Compilation: Representations and Lower Bounds<\/a>, Dagstuhl Workshop on Recent Trends in Knowledge Compilation, September 2017.<\/li>\n\n\n\n<li>Branching Programs and Time-Space Tradeoffs, Nexus of Information and Computation Theories, Institut Henri Poincare, Paris, February 2016\n<ul class=\"wp-block-list\">\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/BP-Talks-IHP-Part1.pptx\">Part 1: Branching Programs and Lower Bounds for Multi-output Functions<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/BP-Talks-IHP-Part2.pptx\">Part 2: Analyzing Boolean Functions on Restricted Branching Programs.<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/BP-Talks-IHP-Part3.pptx\">Part 3: Analyzing Single-Output Functions on General Branching Programs<\/a><\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/BP-Talks-IHP-Extra.pptx\">Extra: Time-Space Tradeoffs for Computing Error-Correcting Codes<\/a><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/ProofComplexityTutorial.pptx\">A Tutorial Introduction to Proof Complexity<\/a>\u00a0Dagstuhl Workshop on Theory and Applications of Satisfiability Testing, April 2015.<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/CommunicationBarriers.pps\">Communication Complexity: An Introduction and Survey with Open Problems<\/a>\u00a0Barriers in Complexity Workshop II, Princeton, NJ, August 2010.<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/sat05invite.ppt\">Satisfiability and Unsatisfiability: Proof Complexity and Algorithms<\/a>\u00a0Invited talk at SAT 05, St. Andrews, June 2005.<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/aaas.ppt\">Phase Transitions in Proof Complexity and Satisfiability Search<\/a>\u00a0AAAS Annual Meeting, Seattle, February 2004.<\/li>\n\n\n\n<li>Techniques for Time-Space Tradeoff Lower Bounds for Branching Programs:<br><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/mparti.ppt\">Part I<\/a>\u00a0and\u00a0<a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/mpartii.ppt\">Part II<\/a>\u00a0McGill Workshop on Branching Programs, Montreal, May 2002.<\/li>\n\n\n\n<li><a href=\"http:\/\/www.cs.washington.edu\/homes\/beame\/talks\/ccc2000.ppt\">Time-Space Tradeoff Lower Bounds for Nonuniform Computation<\/a><a>\u00a0Invited talk at CCC 2000, Florence, July 2000.<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":4,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-32","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/pages\/32","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=32"}],"version-history":[{"count":1,"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/pages\/32\/revisions"}],"predecessor-version":[{"id":33,"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/pages\/32\/revisions\/33"}],"wp:attachment":[{"href":"https:\/\/homes.cs.washington.edu\/~beame\/site\/wp-json\/wp\/v2\/media?parent=32"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}