Campus Event Calendar
Event Entry
What and Who
On the Complexity of the Elementary closure of Polyhedra
Friedrich Eisenbrand
Max-Planck-Institut für Informatik, Saarbrücken, Germany
Seminar des Graduiertenkollegs
AG 1, AG 2
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 14 December 98
16:00
-- Not specified --
45
015
Saarbrücken
Abstract
In this talk, I will prove that the membership problem for the
elementary closure of a polyhedron is NP-complete. This solves a
problem raised by Schrijver (1986).
elementary closure of a polyhedron is NP-complete. This solves a
problem raised by Schrijver (1986).
Contact
Ülkü Coruh
0681/9325-526
--email hidden
passcode not visible
logged in users only