Pages that link to "Item:Q685364"
From MaRDI portal
The following pages link to Improvements on Khrapchenko's theorem (Q685364):
Displaying 10 items.
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- An extension of Khrapchenko's theorem (Q753798) (← links)
- On convex complexity measures (Q964405) (← links)
- Smallest formulas for the parity of \(2^k\) variables are essentially unique (Q974758) (← links)
- The improvement of the Kneser theorem and its applications (Q1107192) (← links)
- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique (Q3511317) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
- (Q5426791) (← links)
- On an improvement of the Hake theorem (Q5932462) (← links)