Go to the corresponding LIPIcs Volume Portal 
Hitchcock, John M. ; Shafei, Hadi
pdfformat: 

@InProceedings{hitchcock_et_al:LIPIcs:2016:5743, author = {John M. Hitchcock and Hadi Shafei}, title = {{Autoreducibility of NPComplete Sets}}, booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)}, pages = {42:142:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770019}, ISSN = {18688969}, year = {2016}, volume = {47}, editor = {Nicolas Ollinger and Heribert Vollmer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/5743}, URN = {urn:nbn:de:0030drops57437}, doi = {10.4230/LIPIcs.STACS.2016.42}, annote = {Keywords: computational complexity, NPcompleteness, autoreducibility, genericity} }
Keywords:  computational complexity, NPcompleteness, autoreducibility, genericity  
Seminar:  33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)  
Issue Date:  2016  
Date of publication:  16.02.2016 