Go to the corresponding LIPIcs Volume Portal 
Gu, Xiaoyang ; Hitchcock, John M. ; Pavan, Aduri
pdfformat: 

@InProceedings{gu_et_al:LIPIcs:2010:2462, author = {Xiaoyang Gu and John M. Hitchcock and Aduri Pavan}, title = {{Collapsing and Separating Completeness Notions under AverageCase and WorstCase Hypotheses}}, booktitle = {27th International Symposium on Theoretical Aspects of Computer Science}, pages = {429440}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897163}, ISSN = {18688969}, year = {2010}, volume = {5}, editor = {JeanYves Marion and Thomas Schwentick}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2010/2462}, URN = {urn:nbn:de:0030drops24627}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2462}, annote = {Keywords: Computational complexity, NPcompleteness} }
Keywords:  Computational complexity, NPcompleteness  
Seminar:  27th International Symposium on Theoretical Aspects of Computer Science  
Issue Date:  2010  
Date of publication:  09.03.2010 