BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Solving Subset Sum via additive combinatorics [Oberseminar Discret
 e Optimization]
DTSTART:20250602T161500Z
DTEND:20250602T171500Z
DTSTAMP:20260305T171000Z
UID:indico-event-320@math-events.uni-bonn.de
DESCRIPTION:Speakers: Guochuan Zhang (Zhejiang University\, Hangzhou)\n\nI
 n the subset sum problem (Subset Sum)\, given a multi-set of positive int
 egers and a target\, the goal is to determine whether there exists a subse
 t of the integers that sums to the target. \nI will talk about recent res
 ults in approximation schemes and exact algorithms for Subset Sum. More pr
 ecisely\, a weak approximation scheme is provided\, which runs in nearly l
 inear time\, and a faster pseudo-polynomial time algorithm is presented. T
 he progress is based on additive combinatorics results on arithmetic progr
 essions.\n \nThis talk is based on joint papers with Lin Chen\, Jiayi Lia
 n and Yuchen Mao.\n \nThe Oberseminar takes place in the Seminarraum\, 1s
 t floor. Participants are invited to have coffee or tea in the lounge befo
 re.\n \n\nhttps://math-events.uni-bonn.de/event/320/
LOCATION:Arithmeum\, Lennéstr.\,  2 - Seminarraum (Arithmeum / Research I
 nstitute for Discrete Mathematics)
URL:https://math-events.uni-bonn.de/event/320/
END:VEVENT
END:VCALENDAR