Campus Event Calendar
Event Entry
What and Who
No occurrence obstructions in geometric complexity theory
Christian Ikenmeyer
Max-Planck-Institut für Informatik - D1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4, AG 5, RG1, SWS, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 11 August 2016
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
joint work with Peter Bürgisser and Greta Panova (FOCS 2016)
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VDET and VNP.
Mulmuley and Sohoni (SIAM J Comput, 2008) suggested to study a strengthened version of this conjecture over the complex numbers and they provided an approach on how to solve the conjecture based on so-called occurrence obstructions.
We prove that this approach is impossible.
Contact
Christian Ikenmeyer
--email hidden
passcode not visible
logged in users only
Christian Ikenmeyer, 08/08/2016 17:00 -- Created document.