Occam's razor, partially specified Boolean functions, string matching, and independent sets

DOI10.1006/INCO.1994.1005zbMath0787.94025OpenAlexW1970441486MaRDI QIDQ1314272

Rafail E. Krichevsky

Publication date: 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1005

zbMATH Keywords

independent setsBoolean functionstring-matching

Mathematics Subject Classification ID

Related Items (2)

Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form ⋮ THEORETICALLY EFFECTIVE ASYMPTOTICALLY OPTIMAL UNIVERSAL CODING OF PARTIALLY DEFINED SOURCES

This page was built for publication: Occam's razor, partially specified Boolean functions, string matching, and independent sets