Kenya Ueno. A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints. In Susanne Albers, Jean-Yves Marion, editors, 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings. Volume 09001 of Dagstuhl Seminar Proceedings, pages 685-696, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009. [doi]
@inproceedings{Ueno09,
title = {A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints},
author = {Kenya Ueno},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/1808},
tags = {constraints},
researchr = {https://researchr.org/publication/Ueno09},
cites = {0},
citedby = {0},
pages = {685-696},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
editor = {Susanne Albers and Jean-Yves Marion},
volume = {09001},
series = {Dagstuhl Seminar Proceedings},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
isbn = {978-3-939897-09-5},
}