On restricted-focus-of-attention learnability of Boolean functions

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn , Issue , 1996, Pages 205-216

  Birkendorf, Andreas ^a   Dichterman, Eli ^a   Jackson, Jeffrey ^a   Klasner, Norbert ^a   Simon, Hans Ulrich ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; LEARNING ALGORITHMS; MATHEMATICAL MODELS; THRESHOLD LOGIC;

K DECISION LISTS (K DL); K RESTRICTED FOCUS OF ATTENTION (K RFA); PARITY FUNCTIONS; PROBABLY APPROXIMATELY CORRECT (PAC) MODEL;

LEARNING SYSTEMS;

EID: 0030383581     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/238061.238098     Document Type: Article

References (12)