๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Analytic Computational Complexity


Book ID
117880145
Publisher
IEEE
Year
1976
Tongue
English
Weight
201 KB
Volume
9
Category
Article
ISSN
0018-9162

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Computational Complexity and Knowledge C
โœ Goldreich, Oded; Ostrovsky, Rafail; Petrank, Erez ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 405 KB
Computational Sample Complexity
โœ Decatur, Scott E.; Goldreich, Oded; Ron, Dana ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 466 KB
Automata-based computational complexity
โœ J. Hartmanis; R.E. Stearns ๐Ÿ“‚ Article ๐Ÿ“… 1969 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 729 KB
Degrees of computational complexity
โœ H.B. Enderton ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 316 KB

We consider a measure ~b of computational complexity. The measure 9 determines a binary relation on the recursive functions; F is no harder to compute than G iff for every index g of G there is an index f off such that for nearly all x, the difficulty off at x (as measured by ~) is no more than the