The complexity of information extraction
- 1 July 1986
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 32 (4) , 513-525
- https://doi.org/10.1109/tit.1986.1057209
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Compositional complexity of Boolean functionsDiscrete Applied Mathematics, 1982
- Towards a theory of local and global in computationTheoretical Computer Science, 1978
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- Information theory and the complexity of boolean functionsTheory of Computing Systems, 1976
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- Information-theoretic computation complexityIEEE Transactions on Information Theory, 1974
- The definition of random sequencesInformation and Control, 1966
- The Synthesis of Two-Terminal Switching CircuitsBell System Technical Journal, 1949
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948
- On Computable Numbers, with an Application to the EntscheidungsproblemProceedings of the London Mathematical Society, 1937