Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, February 03, 2004, 12:15 pm

**Duration**: This information is not available in the database

**Location**: This information is not available in the database

**Speaker**: Sandra Roost

In his paper "Seventeen lines and one-hundred-and-one points", Woeginger describes a
simple a polynomial-time algorithm to find the solution of the following curious
problem:
"Given two positive integers S and Q, does there exist a sequence of positive integers
that add up to S and whose squares add up to Q?"
Along with this problem, he presents a second one about arranging m lines in the
Euclidean plane in a way that there are exactly n points of intersection.

In this talk, I present the two problems, their connection, the algorithm along with its
analysis and the outlook to other problems.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 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