The analysis and research on computational complexity

Computational complexity is a branch of the theory of computation. It is used to measure how hard a problem is solved and the common measures include time and space. The classes of time complexity generally include: P, NP, NP-hard, NP-complete and EXPTIME; the classes of space complexity generally i...

Full description

Saved in:
Bibliographic Details
Published inThe 26th Chinese Control and Decision Conference (2014 CCDC) pp. 3467 - 3472
Main Authors Qiang Gao, Xinhe Xu
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2014
Subjects
Algorithm design and analysis
Computational complexity
Computers
Games
NP-complete
Polynomials
PSPACE-complete
Time complexity
Turing machine
Online AccessGet full text

Cover

More Information
Summary:Computational complexity is a branch of the theory of computation. It is used to measure how hard a problem is solved and the common measures include time and space. The classes of time complexity generally include: P, NP, NP-hard, NP-complete and EXPTIME; the classes of space complexity generally include: PSPACE, NPSPACE, PSPACE-hard and PSPACE-complete. Researching computational complexity of a problem can make it explicit whether there is an effective solving algorithm of the problem or not. This paper introduces and analyzes some fundamental concepts of computational complexity, and discusses complete problems of time complexity and space complexity by examples; What's more, the relation among complexity classes is analyzed in detail.
ISBN:147993707X
9781479937073
ISSN:1948-9439
1948-9447
DOI:10.1109/CCDC.2014.6852777