The largest super-increasing subset of a random set

DOI10.1109/TIT.1983.1056599MaRDI QIDQ3966045zbMATH OpenOpenAlexFDO

Authors Ehud D. Karnin, Martin Edward Hellman

Publication date 1983

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.1983.1056599

zbMATH Keywords

independent uniformly distributed random variableslongest super-increasing sequencesecurity of knapsack-based cryptographic systems

Mathematics Subject Classification ID

Statistical decision theory (62C99) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• On Supremal and Maximal Sets with Respect to Random Partial Orders
• Maximal arithmetic progressions in random subsets
• Infinite subsets of random sets of integers
• Some inequalities concerning random subsets of a set (Corresp.)
• Maximum antichains in random subsets of a finite set
• The maximum size of a Sidon set contained in a sparse random set of integers
• The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets
• Infinite lotteries, large and small sets
• Continuously increasing subsequences of random multiset permutations

This page was built for publication: The largest super-increasing subset of a random set

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