Tech Xplore on MSN
Cracking the code of complexity in computer science's P vs. NP problem
New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science ...
We prove the independence of a strong partition relation on ℵ ω, answering a question of Erdos and Hajnal. We then give an almost complete answer to the free subset problem.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results