Recommendations
Cites work
Cited in
(11)- On an improvement of the Hake theorem
- An extension of Khrapchenko's theorem
- The improvement of the Kneser theorem and its applications
- Smallest formulas for the parity of \(2^k\) variables are essentially unique
- A stronger LP bound for formula size lower bounds via clique constraints
- scientific article; zbMATH DE number 5211136 (Why is no real title available?)
- On convex complexity measures
- Breaking the rectangle bound barrier against formula size lower bounds
- scientific article; zbMATH DE number 3877162 (Why is no real title available?)
- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique
- Exploring the limits of subadditive approaches: parallels between optimization and complexity theory
This page was built for publication: Improvements on Khrapchenko's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685364)