Go to the corresponding LIPIcs Volume Portal 
Lohrey, Markus ; Zetzsche, Georg
pdfformat: 

@InProceedings{lohrey_et_al:LIPIcs:2017:6981, author = {Markus Lohrey and Georg Zetzsche}, title = {{The Complexity of Knapsack in Graph Groups}}, booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)}, pages = {52:152:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770286}, ISSN = {18688969}, year = {2017}, volume = {66}, editor = {Heribert Vollmer and Brigitte ValleĢe}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6981}, URN = {urn:nbn:de:0030drops69810}, doi = {10.4230/LIPIcs.STACS.2017.52}, annote = {Keywords: knapsack, subset sum, graph groups, decision problems in group theory} }
Keywords:  knapsack, subset sum, graph groups, decision problems in group theory  
Collection:  34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)  
Issue Date:  2017  
Date of publication:  06.03.2017 