Improvements on Khrapchenko's theorem
From MaRDI portal
Publication:685364
DOI10.1016/0304-3975(93)90330-VzbMATH Open0777.94022OpenAlexW2044982302MaRDI QIDQ685364FDOQ685364
Authors: Elias Koutsoupias
Publication date: 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90330-v
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
- Title not available (Why is that?)
- On convex complexity measures
- Breaking the rectangle bound barrier against formula size lower bounds
- Title not available (Why is that?)
- 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)