Computational Complexity

Yunqiang Yin, Dujuan Wang, T. C.E. Cheng

Research output: Chapter in book / Conference proceedingChapter in an edited book (as author)Academic researchpeer-review


This chapter is devoted to describe the basic notions related to problems, algorithms and complexity, which provides a mathematical framework in which computational problems are studied so that they can be classified as “easy” or “hard”.

Original languageEnglish
Title of host publicationUncertainty and Operations Research
PublisherSpringer Nature
Number of pages4
Publication statusPublished - 2020

Publication series

NameUncertainty and Operations Research
ISSN (Print)2195-996X
ISSN (Electronic)2195-9978

ASJC Scopus subject areas

  • Decision Sciences(all)

Cite this