Quantifying the amount of verboseness

DOI10.1006/inco.1995.1053zbMath0827.68082OpenAlexW2083063895MaRDI QIDQ1891135

Frank Stephan, Richard Beigel, Martin Kummer

Publication date: 28 May 1995

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

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

zbMATH Keywords

finite combinatorics

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items

Learning recursive functions from approximations, Reducibilities among equivalence relations induced by recursively enumerable structures, On membership comparable sets, Some connections between bounded query classes and non-uniform complexity., On the structures inside truth-table degrees, Regular frequency computations, The communication complexity of enumeration, elimination, and selection, Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete, A structural property of regular frequency computations., Graphs realised by r.e. equivalence relations