pdfformat: 

@InProceedings{andreev_et_al:DSP:2006:609, author = {Alexander E. Andreev and Stasys Jukna}, title = {Very Large Cliques are Easy to Detect}, booktitle = {Complexity of Boolean Functions}, year = {2006}, editor = {Matthias Krause and Pavel Pudl{\'a}k and R{\"u}diger Reischuk and Dieter van Melkebeek}, number = {06111}, series = {Dagstuhl Seminar Proceedings}, ISSN = {18624405}, publisher = {Internationales Begegnungs und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2006/609}, annote = {Keywords: Clique function, monotone circuits, perfect hashing} }
Keywords:  Clique function, monotone circuits, perfect hashing  
Seminar:  06111  Complexity of Boolean Functions  
Issue date:  2006  
Date of publication:  20.11.2006 