An improved multi-set algorithm for the dense subset sum problem

Andrew Shallue

doi:10.1007/978-3-540-79456-1_28

An improved multi-set algorithm for the dense subset sum problem

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Algorithmic Number Theory - 8th International Symposium, ANTS-VIII, Proceedings
Pages	416-429
Number of pages	14
DOIs	https://doi.org/10.1007/978-3-540-79456-1_28
State	Published - 2008
Externally published	Yes
Event	8th International Symposium on Algorithmic Number Theory, ANTS-VIII - Banff, Canada Duration: May 17 2008 → May 22 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5011 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Symposium on Algorithmic Number Theory, ANTS-VIII
Country/Territory	Canada
City	Banff
Period	5/17/08 → 5/22/08

ASJC Scopus Subject Areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-79456-1_28

Cite this

Shallue, A. (2008). An improved multi-set algorithm for the dense subset sum problem. In Algorithmic Number Theory - 8th International Symposium, ANTS-VIII, Proceedings (pp. 416-429). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5011 LNCS). https://doi.org/10.1007/978-3-540-79456-1_28

An improved multi-set algorithm for the dense subset sum problem. / Shallue, Andrew.
Algorithmic Number Theory - 8th International Symposium, ANTS-VIII, Proceedings. 2008. p. 416-429 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5011 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Shallue, A 2008, An improved multi-set algorithm for the dense subset sum problem. in Algorithmic Number Theory - 8th International Symposium, ANTS-VIII, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5011 LNCS, pp. 416-429, 8th International Symposium on Algorithmic Number Theory, ANTS-VIII, Banff, Canada, 5/17/08. https://doi.org/10.1007/978-3-540-79456-1_28

@inproceedings{162d1dfc472143f9ab01029c1965ef59,

title = "An improved multi-set algorithm for the dense subset sum problem",

author = "Andrew Shallue",

year = "2008",

doi = "10.1007/978-3-540-79456-1_28",

language = "English",

isbn = "3540794557",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "416--429",

booktitle = "Algorithmic Number Theory - 8th International Symposium, ANTS-VIII, Proceedings",

note = "8th International Symposium on Algorithmic Number Theory, ANTS-VIII ; Conference date: 17-05-2008 Through 22-05-2008",

}

TY - GEN

T1 - An improved multi-set algorithm for the dense subset sum problem

AU - Shallue, Andrew

PY - 2008

Y1 - 2008

UR - http://www.scopus.com/inward/record.url?scp=44649115943&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44649115943&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-79456-1_28

DO - 10.1007/978-3-540-79456-1_28

M3 - Conference contribution

AN - SCOPUS:44649115943

SN - 3540794557

SN - 9783540794554

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 416

EP - 429

BT - Algorithmic Number Theory - 8th International Symposium, ANTS-VIII, Proceedings

T2 - 8th International Symposium on Algorithmic Number Theory, ANTS-VIII

Y2 - 17 May 2008 through 22 May 2008

ER -

An improved multi-set algorithm for the dense subset sum problem

Publication series

Conference

ASJC Scopus Subject Areas

Access to Document

Other files and links

Cite this