The complexity of an algorithm is usually expressed using complexity functions and complexity classes, in this paper we present a method to reduce the work with multi-variable complexity functions to the work with one-variable complexity functions. We define five complexity classes for multi-variable complexity functions and then we prove some properties for these classes. [ABSTRACT FROM AUTHOR]
Published
2009
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.