Abstract
By the invariant theory of complexity we mean the theory that can be formulated independently of any computational (or generative) model. Three ways are possible to develop it.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Uspensky, V., Semenov, A. (1993). First steps in the invariant, or machine-independent, theory of complexity of computations. In: Algorithms: Main Ideas and Applications. Mathematics and Its Applications, vol 251. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8232-2_19
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_19
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive