An information-theoretic method in combinatorial theory

DOI10.1016/0097-3165(77)90083-8zbMath0361.94038OpenAlexW2045394325MaRDI QIDQ1239715

Nicholas J. 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)

Related Items (7)

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

Cites Work

• A Mathematical Theory of Communication
• On a Combinatorial Problem in Number Theory
• Determination of a Subset from Certain Combinatorial Properties
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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