The complexity of information extraction

DOI10.1109/TIT.1986.1057209zbMATH Open0609.94009MaRDI QIDQ3751504FDOQ3751504

Authors: Yaser S. Abu-Mostafa 

Publication date: 1986

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• Random problems
• scientific article; zbMATH DE number 194098
• Information approach to the problems of pattern recognition
• scientific article; zbMATH DE number 622666
• Two Problems for Sophistication

zbMATH Keywords

complexitypattern recognitionBoolean functionrandomnessdecision problemsdeterministic entropyimplementation costnatural data

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Analysis of algorithms and problem complexity (68Q25) Information theory (general) (94A15)

Cited In (7)

• Lower bound for connectivity in local-learning neural networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Almost everywhere high nonuniform complexity
• Title not available (Why is that?)
• Random problems
• Title not available (Why is that?)

This page was built for publication: The complexity of information extraction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751504)