Approximating hyper-rectangles: Learning and pseudo-random sets

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 1997, Pages 314-323

  Auer, Peter ^a   Long, Philip M ^a   Srinivasan, Aravind ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; LEARNING ALGORITHMS; LEARNING SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

RAMSEY GRAPHS; RANDOMIZED LOGSPACE;

SET THEORY;

EID: 0030642912     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (36)