Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:No occurrence obstructions in geometric complexity theory
Speaker:Christian Ikenmeyer
coming from:Max-Planck-Institut für Informatik - D1
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1, D2, D3, D4, D5, RG1, SWS, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Thursday, 11 August 2016
Duration:30 Minutes
Building:E1 4
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.

Name(s):Christian Ikenmeyer
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):

Christian Ikenmeyer, 08/08/2016 05:00 PM
Last modified:
Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Christian Ikenmeyer, 08/08/2016 05:00 PM -- Created document.