Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
STACS
/
Paper
Dense Subset Sum May Be the Hardest.
Per Austrin
,
Petteri Kaski
,
Mikko Koivisto
,
Jesper Nederlof
Venue
A
STACS
Year
2016
Proceedings
STACS
DBLP record
conf/stacs/AustrinKKN16 ↗
Browse the full
STACS paper archive
.