William Gasarch is a computer scientist known for his contributions to theoretical computer science, particularly in the fields of computational complexity theory, algorithms, and the study of problems in analysis of algorithms. He is also recognized for his work in the field of mathematical logic. Gasarch is a professor at the University of Maryland and has published numerous research papers on topics such as complexity classes, NP-completeness, and various other areas of theoretical computing.
New to topics? Read the docs here!