BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Vrije Universiteit Amsterdam//NONSGML v1.0//EN
NAME:PhD defence D. van den Berg
METHOD:PUBLISH
BEGIN:VEVENT
DTSTART:20260310T114500
DTEND:20260310T131500
DTSTAMP:20260310T114500
UID:phd-defence-d-van-den-berg@8F96275E-9F55-4B3F-A143-836282E12573
CREATED:20260826T130652
LOCATION:
SUMMARY:PhD defence D. van den Berg
X-ALT-DESC;FMTTYPE=text/html: <html> <body> <p><p>Where the Really Har
 d Problems Went</p></p> <p><strong>Computer scientist Daniël van den
  Berg demonstrates that difficult problems can appear in unexpected p
 laces.</strong></p><p>Not all computer problems are equally difficult
 . In his research, Van den Berg and his fellow researchers searched f
 or the very hardest problems within a class. They found these problem
 s in an unexpected place: among the very easiest problems.</p><p>The 
 research was conducted using computer simulations and runtime.</p><p>
 Van den Berg and his colleagues hope to eventually demonstrate what t
 hese most difficult problems look like and how they can be made easie
 r. For example, could the Dutch Railways (NS) timetable be simplified
  by adding or removing a few kilometers of track?</p><p>More informat
 ion on the <a href="https://hdl.handle.net/1871.1/b4a645c7-a4a5-480d-
 a2c6-a62cb4cd42ae" data-new-window="true" target="_blank" rel="noopen
 er noreferrer">thesis</a></p> </body> </html>
DESCRIPTION: Where the Really Hard Problems Went <strong>Computer scie
 ntist Daniël van den Berg demonstrates that difficult problems can a
 ppear in unexpected places.</strong>Not all computer problems are equ
 ally difficult. In his research, Van den Berg and his fellow research
 ers searched for the very hardest problems within a class. They found
  these problems in an unexpected place: among the very easiest proble
 ms.The research was conducted using computer simulations and runtime.
 Van den Berg and his colleagues hope to eventually demonstrate what t
 hese most difficult problems look like and how they can be made easie
 r. For example, could the Dutch Railways (NS) timetable be simplified
  by adding or removing a few kilometers of track?More information on 
 the <a href="https://hdl.handle.net/1871.1/b4a645c7-a4a5-480d-a2c6-a6
 2cb4cd42ae" data-new-window="true" target="_blank" rel="noopener nore
 ferrer">thesis</a>
END:VEVENT
END:VCALENDAR
