Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Faster Space Efficient Algorithms for Subset Sum and Knapsack
Speaker:Jesper Nederlof
coming from:Eindhoven University of Technology
Speakers Bio:
Event Type:AG1 Mittagsseminar (own work)
Visibility:D1
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Tuesday, 31 January 2017
Time:13:00
Duration:30 Minutes
Location:Saarbr├╝cken
Building:E1 4 - MPI-INF
Room:024
Abstract
We present a randomized Monte Carlo algorithm that solves a given instance of Subset Sum on n integers using O*(2^{0.86n}) time and O*(1) space, where O*() suppresses factors polynomial in the input size. The algorithm assumes random access to the random bits used. The same result can be obtained for Knapsack on n items, and the same methods also have consequences for the k-Sum problem. Joint work with Nikhil Bansal, Shashwat Garg and Nikhil Vyas.
Contact
Name(s):Holger Dell
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):
Created by:Holger Dell, 01/11/2017 07:04 PMLast modified by:Uwe Brahm/MPII/DE, 01/31/2017 04:00 AM
  • Holger Dell, 01/11/2017 07:04 PM -- Created document.