A Survey on Worst-Case Complexity of SAT - UBC Library Open Collections

BIRS Workshop Lecture Videos

Featured Collection

BIRS Workshop Lecture Videos

A Survey on Worst-Case Complexity of SAT Santhanam, Rahul

Description

I will survey work on exact algorithms for SAT, analyzed by their worst-case complexity. I will mention some of the algorithmic paradigms and methods of analysis used, and propose several directions for further research.

Item Metadata

Title	A Survey on Worst-Case Complexity of SAT
Creator	Santhanam, Rahul
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-08-30T11:31
Description	I will survey work on exact algorithms for SAT, analyzed by their worst-case complexity. I will mention some of the algorithmic paradigms and methods of analysis used, and propose several directions for further research.
Extent	59.0
Subject	Mathematics; Computer science; Mathematical logic and foundations; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Oxford
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-04-04
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0377792
URI	http://hdl.handle.net/2429/69444
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

Item Media

201808301131-Santhanam_lrv.mp4 -- 217MB

Item Citations and Data

Rights

Attribution-NonCommercial-NoDerivatives 4.0 International