Title	Resolution and the binary encodings of combinatorial principles
Creator	Galesi, Nicola
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2020-01-21T16:32
Description	We compare the complexity of refuting the binary and unary versions of large classes of combinatorial principles in Resolution and its extension Res(s) to s-DNFs. In particular we prove size lower bonds in Res(s) for the binary versions of the weak pigeonhole principle and the k-clique principle. The talk is based on a joint work with Stefan Dantchev and Barnaby Martin.
Extent	31.0 minutes
Subject	Mathematics; Computer science; Mathematical logic and foundations; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Università degli Studi di Roma La Sapienza
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2020-07-20
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0392461
URI	http://hdl.handle.net/2429/75214
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos