×

zbMATH — the first resource for mathematics

A theorem on nonprovability of lower time bounds for a class of functions. (Russian) Zbl 0422.03014
MSC:
03D15 Complexity of computation (including implicit computational complexity)
PDF BibTeX XML Cite
Full Text: EuDML