Go to the corresponding LIPIcs Volume Portal 
Hemaspaandra, Edith ; Hemaspaandra, Lane A. ; Spakowski, Holger ; Watanabe, Osamu
pdfformat: 

@InProceedings{hemaspaandra_et_al:LIPIcs:2018:9633, author = {Edith Hemaspaandra and Lane A. Hemaspaandra and Holger Spakowski and Osamu Watanabe}, title = {{The Robustness of LWPP and WPP, with an Application to Graph Reconstruction}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {51:151:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770866}, ISSN = {18688969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9633}, URN = {urn:nbn:de:0030drops96330}, doi = {10.4230/LIPIcs.MFCS.2018.51}, annote = {Keywords: structural complexity theory, robustness of counting classes, the legitimate deck problem, PPlowness, the Reconstruction Conjecture} }
Keywords:  structural complexity theory, robustness of counting classes, the legitimate deck problem, PPlowness, the Reconstruction Conjecture  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue Date:  2018  
Date of publication:  20.08.2018 