Williams was especially drawn to a branch of theoretical computer science called computational complexity theory. It deals with the resources (such as time and space) that are needed to solve ...

Computing The 50-year-old problem that eludes theoretical computer science A solution to P vs NP could unlock countless computational problems—or keep them forever out of reach.

Computer Scientists Discover Limits of Major Research Algorithm The most widely used technique for finding the largest or smallest values of a math function turns out to be a fundamentally difficult ...

In the subfield of theoretical computer science called complexity theory, researchers try to pin down how easily computers can solve various types of problems.

Complexity theory remains one of the great unsolved mathematical puzzles. Kenneth Regan is trying to figure it out.

According to Fiesler, the “I am just an engineer” problem is caused by the common way computer science is taught, which treats ethics as its own specialization. She thinks ethics should be ...

A new paper published in the journal Entropy shows how tools from information theory, a branch of complexity science, can address this challenge by quickly homing in on portions of the data that ...

Program Description The graduate programs in computer science offer intensive preparation in design, programming, theory and applications. Training is provided for both academically oriented students ...