Hitting sets when the VC-dimension is small (Q1041786): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost tight bounds for \(\epsilon\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel approximation algorithm for positive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving some discrepancy problems in NC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Fractional Packing and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886046 / rank
 
Normal rank

Latest revision as of 06:38, 2 July 2024

scientific article
Language Label Description Also known as
English
Hitting sets when the VC-dimension is small
scientific article

    Statements

    Identifiers