A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints

DOI10.4230/LIPICS.STACS.2009.1808zbMath1236.68099OpenAlexW2242767567MaRDI QIDQ5390018

Kenya Ueno

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_fc77.html

zbMATH Keywords

computational and structural complexity

Mathematics Subject Classification ID

Linear programming (90C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

This page was built for publication: A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints