Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm

Per Austrin; Petteri Kaski; Mikko Koivisto; Jussi Määttä

doi:10.1007/978-3-642-39206-1_5

Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm

Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Määttä

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

Original language	English
Title of host publication	Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 2013, Proceedings, Part I
Editors	Fedor V. Fomin, Rūsiņš Freivalds, Marta Kwiatkowska, David Peleg
Number of pages	12
Publisher	Springer-Verlag
Publication date	2013
Pages	45-56
ISBN (Print)	978-3-642-39205-4
ISBN (Electronic)	978-3-642-39206-1
DOIs	https://doi.org/10.1007/978-3-642-39206-1_5
Publication status	Published - 2013
MoE publication type	A4 Article in conference proceedings
Event	International Colloquium on Automata, Languages and Programming - Riga, Latvia Duration: 8 Jul 2013 → 12 Jul 2013 Conference number: 40 (ICALP)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Berlin Heidelberg
Volume	7965
ISSN (Print)	0302-9743

Fields of Science

113 Computer and information sciences

Access to Document

10.1007/978-3-642-39206-1_5

http://dx.doi.org/10.1007/978-3-642-39206-1_5

Cite this

Austrin, P., Kaski, P., Koivisto, M., & Määttä, J. (2013). Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. In F. V. Fomin, R. Freivalds, M. Kwiatkowska, & D. Peleg (Eds.), Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 2013, Proceedings, Part I (pp. 45-56). (Lecture Notes in Computer Science; Vol. 7965). Springer-Verlag. https://doi.org/10.1007/978-3-642-39206-1_5

Austrin, Per ; Kaski, Petteri ; Koivisto, Mikko et al. / Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 2013, Proceedings, Part I. editor / Fedor V. Fomin ; Rūsiņš Freivalds ; Marta Kwiatkowska ; David Peleg. Springer-Verlag, 2013. pp. 45-56 (Lecture Notes in Computer Science).

@inproceedings{97aaa2f8a44640189126b629721d5981,

title = "Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm",

keywords = "113 Computer and information sciences",

author = "Per Austrin and Petteri Kaski and Mikko Koivisto and Jussi M{\"a}{\"a}tt{\"a}",

year = "2013",

doi = "10.1007/978-3-642-39206-1_5",

language = "English",

isbn = "978-3-642-39205-4",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag",

pages = "45--56",

editor = "Fomin, {Fedor V.} and Rūsiņ{\v s} Freivalds and Marta Kwiatkowska and David Peleg",

booktitle = "Automata, Languages, and Programming",

address = "Germany",

note = "International Colloquium on Automata, Languages and Programming ; Conference date: 08-07-2013 Through 12-07-2013",

}

Austrin, P, Kaski, P, Koivisto, M & Määttä, J 2013, Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. in FV Fomin, R Freivalds, M Kwiatkowska & D Peleg (eds), Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 2013, Proceedings, Part I. Lecture Notes in Computer Science, vol. 7965, Springer-Verlag, pp. 45-56, International Colloquium on Automata, Languages and Programming, Riga, Latvia, 08/07/2013. https://doi.org/10.1007/978-3-642-39206-1_5

Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. / Austrin, Per; Kaski, Petteri; Koivisto, Mikko et al.
Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 2013, Proceedings, Part I. ed. / Fedor V. Fomin; Rūsiņš Freivalds; Marta Kwiatkowska; David Peleg. Springer-Verlag, 2013. p. 45-56 (Lecture Notes in Computer Science; Vol. 7965).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm

AU - Austrin, Per

AU - Kaski, Petteri

AU - Koivisto, Mikko

AU - Määttä, Jussi

N1 - Conference code: 40 (ICALP)

PY - 2013

Y1 - 2013

KW - 113 Computer and information sciences

U2 - 10.1007/978-3-642-39206-1_5

DO - 10.1007/978-3-642-39206-1_5

M3 - Conference contribution

SN - 978-3-642-39205-4

T3 - Lecture Notes in Computer Science

SP - 45

EP - 56

BT - Automata, Languages, and Programming

A2 - Fomin, Fedor V.

A2 - Freivalds, Rūsiņš

A2 - Kwiatkowska, Marta

A2 - Peleg, David

PB - Springer-Verlag

T2 - International Colloquium on Automata, Languages and Programming

Y2 - 8 July 2013 through 12 July 2013

ER -

Austrin P, Kaski P, Koivisto M, Määttä J. Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. In Fomin FV, Freivalds R, Kwiatkowska M, Peleg D, editors, Automata, Languages, and Programming: 40th International Colloquium, ICALP 2013, Riga, Latvia, July 2013, Proceedings, Part I. Springer-Verlag. 2013. p. 45-56. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-39206-1_5