pdfformat: 

@InProceedings{arvind_et_al:LIPIcs:2009:1801, author = {Vikraman Arvind and Partha Mukhopadhyay}, title = {{Quantum Query Complexity of Multilinear Identity Testing}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {8798}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897095}, ISSN = {18688969}, year = {2009}, volume = {3}, editor = {Susanne Albers and JeanYves Marion}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2009/1801}, URN = {urn:nbn:de:0030drops18014}, doi = {10.4230/LIPIcs.STACS.2009.1801}, annote = {Keywords: Quantum algorithm, Identity testing, Query complexity, Multilinear polynomials} }
Keywords:  Quantum algorithm, Identity testing, Query complexity, Multilinear polynomials  
Seminar:  26th International Symposium on Theoretical Aspects of Computer Science  
Issue date:  2009  
Date of publication:  2009 