Albert Atserias, Universitat Politècnica de Catalunya, Microsoft Research Lectures

Add to your list(s) Download to your calendar using vCal

• Albert Atserias, Universitat Politècnica de Catalunya
• Tuesday 25 January 2011, 10:00-11:00
• Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

Resolution underlies most state-of-the-art satisfiability-solving algorithms that are used in practice. I will start my talk by discussing this. Then I will focus on explaining some new understanding of the power of these algorithms that emerged from a novel kind of analysis of the produced proofs of unsatisfiability. The outcome is that the current standard methods for satisfiability-solving have the potential of simulating bounded-width resolution with polynomial-time overhead, provided they do random decisions and restarts often enough.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Small lecture theatre, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.