Recommendations
Cites work
- scientific article; zbMATH DE number 1324671 (Why is no real title available?)
- A new strategy for querying priced information
- A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
- Complexity measures and decision tree complexity: a survey.
- On the competitive ratio of evaluating priced functions
- Query strategies for priced information
- The critical complexity of all (monotone) boolean functions and monotone graph properties
Cited in
(10)- Counting the number of vertex covers in a trapezoid graph
- scientific article; zbMATH DE number 221461 (Why is no real title available?)
- On the minimal cover property in \(\mathbf{ZF}\)
- scientific article; zbMATH DE number 165076 (Why is no real title available?)
- Minimum resolvable coverings with small parallel classes
- A note on small covers over cubes
- \textsc{MAX MIN} vertex cover and the size of Betti tables
- On the Size of Minimum Super Arrovian Domains
- A note on the core: minimal conversely consistent enlargement
- AN ERDŐS-KO-RADO THEOREM FOR MINIMAL COVERS
This page was built for publication: A note on the size of minimal covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845985)