Theory of computational complexity
Du, Ding-Zhu, Ker‐I Ko
Abstract
Du, Ding-Zhu, Ker‐I Ko
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.
OpenAlex reports 229 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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