Quantifying the amount of verboseness

DOI10.1006/INCO.1995.1053MaRDI QIDQ1891135zbMATH OpenOpenAlexFDO

Authors Richard Beigel, Martin Kummer, Frank Stephan

Publication date 28 May 1995

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Recommendations

• scientific article; zbMATH DE number 1678392
• Terse, superterse, and verbose sets
• scientific article; zbMATH DE number 517081
• On polynomially \(\mathcal{D}\)-verbose sets
• scientific article; zbMATH DE number 1405575

Cited in

(13)

• Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
• Learning recursive functions from approximations
• Some connections between bounded query classes and non-uniform complexity.
• Regular frequency computations
• A structural property of regular frequency computations.
• On membership comparable sets
• Graphs realised by r.e. equivalence relations
• On the structures inside truth-table degrees
• scientific article; zbMATH DE number 1678392 (Why is no real title available?)
• A proof of Beigel's cardinality conjecture
• scientific article; zbMATH DE number 517081 (Why is no real title available?)
• The communication complexity of enumeration, elimination, and selection
• Reducibilities among equivalence relations induced by recursively enumerable structures

This page was built for publication: Quantifying the amount of verboseness

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