pdfformat: 

@InProceedings{chakaravarthy_et_al:LIPIcs:2008:1342, author = {Venkatesan T. Chakaravarthy and Sambuddha Roy}, title = {{Finding Irrefutable Certificates for S_2^p via Arthur and Merlin}}, booktitle = {25th International Symposium on Theoretical Aspects of Computer Science}, pages = {157168}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897064}, ISSN = {18688969}, year = {2008}, volume = {1}, editor = {Susanne Albers and Pascal Weil}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2008/1342}, URN = {urn:nbn:de:0030drops13421}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2008.1342}, annote = {Keywords: Symmetric alternation, promiseAM, KarpLipton theorem, learning circuits} }
Keywords:  Symmetric alternation, promiseAM, KarpLipton theorem, learning circuits  
Seminar:  25th International Symposium on Theoretical Aspects of Computer Science  
Issue date:  2008  
Date of publication:  06.02.2008 