Go to the corresponding LIPIcs Volume Portal 
Chia, NaiHui ; Hallgren, Sean
pdfformat: 

@InProceedings{chia_et_al:LIPIcs:2016:6687, author = {NaiHui Chia and Sean Hallgren}, title = {{How Hard Is Deciding Trivial Versus Nontrivial in the Dihedral Coset Probleml}}, booktitle = {11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)}, pages = {6:16:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770194}, ISSN = {18688969}, year = {2016}, volume = {61}, editor = {Anne Broadbent}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6687}, URN = {urn:nbn:de:0030drops66877}, doi = {10.4230/LIPIcs.TQC.2016.6}, annote = {Keywords: Quantum algorithms, hidden subgroup problem, random subset sum problem} }
Keywords:  Quantum algorithms, hidden subgroup problem, random subset sum problem  
Seminar:  11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016)  
Issue Date:  2016  
Date of publication:  13.09.2016 