Title	Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices
Creator	Saberi, Amin
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2017-11-14T10:30
Description	I will present a deterministic polynomial time c^n approximation algorithm for the permanent of positive semidefinite matrices where c ~ 4.84. This is through a natural convex programming relaxation and proving a PSD variation of the Van der Waerden's theorem. Joint work with Nima Anari, Shayan Oveis Gharan, and Leonid Gurvitz.
Extent	28 minutes
Subject	Mathematics; Computer science; Operations research, mathematical programming; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Stanford University
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-05-14
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0366268
URI	http://hdl.handle.net/2429/65836
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