A New Rank Technique for Formula Size Lower Bounds
From MaRDI portal
Publication:3590928
DOI10.1007/978-3-540-70918-3_13zbMath1186.68211OpenAlexW1857141208MaRDI QIDQ3590928
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_13
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes ⋮ A stronger LP bound for formula size lower bounds via clique constraints ⋮ Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory ⋮ BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS ⋮ On convex complexity measures ⋮ Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
This page was built for publication: A New Rank Technique for Formula Size Lower Bounds
