ScholarLens Back to search
2015•Computer Knowledge and TechnologyRequires access

Class Spectrogram of Computational Complexity

Ji Zhang

Open publisher page 0 citations

Abstract

The computational complexity of a problem is the complexity of solving it with a computer.One of its measures is to calculate the required number of steps or instructions(that is, the time complexity),the other is to calculate the number of storage unit(i.e., space complexity).The set of all the problems with similar complexity is a complexity class.In this paper,we discussed severalcommon and important computational complexity classes in computational complexity theory,and studied the significance of theclassification of computational complexity and some relations between the complexity classes.

About this research paper

What this paper is about

The computational complexity of a problem is the complexity of solving it with a computer.One of its measures is to calculate the required number of steps or instructions(that is, the time complexity),the other is to calculate the number of storage unit(i.e., space complexity).The set of all the problems with similar complexity is a complexity class.In this paper,we discussed severalcommon and important computational complexity classes in computational complexity theory,and studied the significance of theclassification of computational complexity and some relations between the complexity classes.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The computational complexity of a problem is the complexity of solving it with a computer.One of its measures is to calculate the required number of steps or instructions(that is, the time complexity),the other is to calculate the number of storage unit(i.e., space complexity).The set of all the problems with similar complexity is a complexity class.In this paper,we discussed severalcommon and important computational complexity classes in computational complexity theory,and studied the significance of theclassification of computational complexity and some relations between the complexity classes.

Key concepts: Computational complexity theory, Asymptotic computational complexity, Computer science, Structural complexity theory, Computational resource, Worst-case complexity, Descriptive complexity theory, Quantum complexity theory

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Class Spectrogram of Computational Complexity — Research Paper | ScholarLens