An information-theoretic method in combinatorial theory

DOI10.1016/0097-3165(77)90083-8MaRDI QIDQ1239715zbMATH OpenOpenAlexFDO

Authors Nicholas Pippenger

Publication date 1977

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(77)90083-8

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Information theory (general) (94A15)

Cites work

• A Mathematical Theory of Communication
• Determination of a Subset from Certain Combinatorial Properties
• scientific article; zbMATH DE number 3482343 (Why is no real title available?)
• scientific article; zbMATH DE number 3499765 (Why is no real title available?)
• scientific article; zbMATH DE number 3207626 (Why is no real title available?)
• scientific article; zbMATH DE number 3261634 (Why is no real title available?)
• scientific article; zbMATH DE number 3278949 (Why is no real title available?)
• scientific article; zbMATH DE number 3313256 (Why is no real title available?)
• On a Combinatorial Problem in Number Theory

Cited in

(7)

• The covering problem of complete uniform hypergraphs
• Kolmogorov complexity arguments in combinatorics
• Better lower bounds for monotone threshold formulas
• On the metric dimension of Cartesian powers of a graph
• Philosophical issues in Kolmogorov complexity
• Toward a deterministic polynomial time algorithm with optimal additive query complexity
• A dropping proof of an entropy inequality

This page was built for publication: An information-theoretic method in combinatorial theory

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