@InProceedings{ueno:LIPIcs.STACS.2009.1808, author = {Ueno, Kenya}, title = {{A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints}}, booktitle = {26th International Symposium on Theoretical Aspects of Computer Science}, pages = {685--696}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-09-5}, ISSN = {1868-8969}, year = {2009}, volume = {3}, editor = {Albers, Susanne and Marion, Jean-Yves}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1808}, URN = {urn:nbn:de:0030-drops-18080}, doi = {10.4230/LIPIcs.STACS.2009.1808}, annote = {Keywords: Computational and structural complexity} }