Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, February 24, 2022, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Eleonora Eichelberg
Counting crossing-free structures on a given point set, in particular triangulations, is a well-known problem. Yet its computational complexity is mostly unknown. In this talk we consider variants of the problem in which we impose conditions on the edge set: either by forbidding edges (so called restricted counting problems) or by requiring edges (so called augmented counting problems). We present some #P-completeness results in this setting and show by the example of counting restricted cycle covers how such results may be obtained by reducing planar #3-SAT.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login