Robust information-theoretic private information retrieval
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Communication lower bounds via the chromatic number
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Sans constraints? feature diagrams vs. feature models
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
A stronger LP bound for formula size lower bounds via clique constraints
Theoretical Computer Science
| Hi-index | 0.00 |
Korner defined the notion of graph entropy. He used it to simplify the proof of the Fredman--Komlos lower bound for the family size of perfect hash functions. We use this information-theoretic notion to obtain a general method for formula size lower bounds. This method can be applied to low-complexity functions for which the other known general methods do not apply.