pdfformat: 

@InProceedings{belovs_et_al:LIPIcs:2018:9250, author = {Aleksandrs Belovs and Ansis Rosmanis}, title = {{Quantum Lower Bounds for Tripartite Versions of the Hidden Shift and the Set Equality Problems}}, booktitle = {13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)}, pages = {3:13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770804}, ISSN = {18688969}, year = {2018}, volume = {111}, editor = {Stacey Jeffery}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9250}, URN = {urn:nbn:de:0030drops92501}, doi = {10.4230/LIPIcs.TQC.2018.3}, annote = {Keywords: Adversary Bound, Dual Learning Graphs, Quantum Query Complexity, Representation Theory} }
Keywords:  Adversary Bound, Dual Learning Graphs, Quantum Query Complexity, Representation Theory  
Seminar:  13th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2018)  
Issue date:  2018  
Date of publication:  16.07.2018 