Go to the corresponding Portal 
Durand, Arnaud ; Lautemann, Clemens ; More, Malika
pdfformat: 

@InProceedings{durand_et_al:DagSemProc.06451.4, author = {Durand, Arnaud and Lautemann, Clemens and More, Malika}, title = {{Counting Results in Weak Formalisms}}, booktitle = {Circuits, Logic, and Games}, pages = {111}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {18624405}, year = {2007}, volume = {6451}, editor = {Thomas Schwentick and Denis Th\'{e}rien and Heribert Vollmer}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2007/976}, URN = {urn:nbn:de:0030drops9767}, doi = {10.4230/DagSemProc.06451.4}, annote = {Keywords: Small complexity classes, logic, polylog counting} }
Keywords:  Small complexity classes, logic, polylog counting  
Collection:  06451  Circuits, Logic, and Games  
Issue Date:  2007  
Date of publication:  23.04.2007 