Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds

From MaRDI portal
Publication:3586121
Jump to:navigation, search

DOI10.1007/978-3-642-15155-2_58zbMATH Open1287.68053OpenAlexW1532729668MaRDI QIDQ3586121FDOQ3586121

Kenya Ueno

Publication date: 3 September 2010

Published in: Mathematical Foundations of Computer Science 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15155-2_58




Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Integer programming (90C10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)



Cited In (1)

  • Average-case lower bounds for formula size






This page was built for publication: Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586121)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3586121&oldid=16995731"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 03:06. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki