Arrow Research search
Back to STOC

STOC 1997

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets

Conference Paper Session 5B Algorithms and Complexity ยท Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

  • PAC learning
  • Ramsey graphs
  • approximations of distributions
  • derandomization
  • explicit constructions
  • machine learning
  • multiple-instance learning
  • pseudorandomness
  • random graphs
  • rectangles
  • sample complexity

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
867570196933867964
v2026.09.13