2001Choice Reviews OnlineRequires access

Theory of computational complexity

Du, Ding-Zhu, Ker‐I Ko

Open publisher page 229 citations

Abstract

DING-ZHU DU, PhD, is a professor in the Department of Computer Science at the University of Minnesota. KER-I KO, PhD, is a professor in the Department of Computer Science at the State University of New York at Stony Brook.

About this research paper

What this paper is about

DING-ZHU DU, PhD, is a professor in the Department of Computer Science at the University of Minnesota. KER-I KO, PhD, is a professor in the Department of Computer Science at the State University of New York at Stony Brook.

Why it matters

OpenAlex reports 229 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

DING-ZHU DU, PhD, is a professor in the Department of Computer Science at the University of Minnesota. KER-I KO, PhD, is a professor in the Department of Computer Science at the State University of New York at Stony Brook.

Key concepts: Structural complexity theory, Complexity class, PH, Computational complexity theory, Descriptive complexity theory, Time complexity, Mathematical proof, PSPACE

Related papers

Back to paper searchBrowse research topicsOriginal source
Theory of computational complexity — Research Paper | ScholarLens