The complexity of information extraction

DOI10.1109/TIT.1986.1057209MaRDI QIDQ3751504zbMATH OpenFDO

Authors Yaser S. Abu-Mostafa

Publication date 1986

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

Full work available at URL https://doi.org/10.1109/TIT.1986.1057209

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)

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

Cited in

(7)

• Lower bound for connectivity in local-learning neural networks
• scientific article; zbMATH DE number 1966615 (Why is no real title available?)
• scientific article; zbMATH DE number 2120030 (Why is no real title available?)
• Almost everywhere high nonuniform complexity
• scientific article; zbMATH DE number 5957305 (Why is no real title available?)
• Random problems
• scientific article; zbMATH DE number 1728551 (Why is no real title available?)

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)