Melvyn Bragg and guests discuss P versus NP, an unsolved problem in maths that asks if the answers to all problems can be found as easily as they can be checked. Show more Melvyn Bragg and guests ...

Discover the mysteries of the P versus NP problem and the recent proof by Vinay Deolalikar that could change computational complexity forever. The P versus NP question concerns the speed at which a ...

Complexity theory remains one of the great unsolved mathematical puzzles. Kenneth Regan is trying to figure it out. Kenneth Regan paused at lunch in New York to glance at incoming texts from top ...