We use cookies on this site. By browsing our site you agree to our use of cookies. Close this message Find out more

Home > Computer Science home > Events > Seminar Neil Thapen
More in this section Events articles

Seminar Neil Thapen

27/02/2018 (15:00-16:00)

Neil Thapen

Neil Thapen, Institute of Mathematics, AS CR, Czech Republic

Random resolution and approximate counting

Resolution is a propositional proof system that is bad at formalizing arguments involving counting, even approximately. I will discuss some upper and lower bounds on random resolution, which roughly speaking adds to resolution the ability to use any axiom, as long as it is true most of the time. This is partly motivated by a question about a related first-order proof system of bounded arithmetic with approximate counting.


Comment on this page

Did you find the information you were looking for? Is there a broken link or content that needs updating? Let us know so we can improve the page.

Note: If you need further information or have a question that cannot be satisfied by this page, please call our switchboard on +44 (0)1784 434455.

This window will close when you submit your comment.

Add Your Feedback