Where the Really Hard P roblems Went
Computer scientist Daniël van den Berg d emonstrates that difficult problems can appear in unexpected places.< /strong>
Not all computer problems are equally difficult. In hi s research, Van den Berg and his fellow researchers searched for the very hardest problems within a class. They found these problems in an unexpected place: among the very easiest problems.
The researc h was conducted using computer simulations and runtime.
Van den Berg and his colleagues hope to eventually demonstrate what these mo st difficult problems look like and how they can be made easier. For example, could the Dutch Railways (NS) timetable be simplified by add ing or removing a few kilometers of track?
More information on the thesis
DESCRIPTION: Computer scientist Daniël van den Berg demonstra tes that difficult problems can appear in unexpected places. Not all computer problems are equally difficult. In his research, Va n den Berg and his fellow researchers searched for the very hardest p roblems within a class. They found these problems in an unexpected pl ace: among the very easiest problems. The research was conducted usin g computer simulations and runtime. Van den Berg and his colleagues h ope to eventually demonstrate what these most difficult problems look like and how they can be made easier. For example, could the Dutch R ailways (NS) timetable be simplified by adding or removing a few kilo meters of track? More information on the thesis Where the Rea lly Hard Problems Went END:VEVENT END:VCALENDAR