Go to the corresponding LIPIcs Volume Portal 
Lê, Dai Tri Man ; Cook, Stephen A. ; Ye, Yuli
pdfformat: 

@InProceedings{l_et_al:LIPIcs:2011:3244, author = {Dai Tri Man Lê and Stephen A. Cook and Yuli Ye}, title = {{A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem}}, booktitle = {Computer Science Logic (CSL'11)  25th International Workshop/20th Annual Conference of the EACSL}, pages = {381395}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897323}, ISSN = {18688969}, year = {2011}, volume = {12}, editor = {Marc Bezem}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3244}, URN = {urn:nbn:de:0030drops32440}, doi = {http://dx.doi.org/10.4230/LIPIcs.CSL.2011.381}, annote = {Keywords: bounded arithmetic, complexity theory, comparator circuits} }
Keywords:  bounded arithmetic, complexity theory, comparator circuits  
Seminar:  Computer Science Logic (CSL'11)  25th International Workshop/20th Annual Conference of the EACSL  
Issue Date:  2011  
Date of publication:  31.08.2011 