Welcome to MSDN Blogs Sign in | Join | Help

Developing for Developers

Tools, techniques, and theory for measuring and improving the power and performance of developers and their code

Syndication

Browse by Tags

All Tags » Theory   (RSS)
P-complete and the limits of parallelization
We're entering an era where CPU clock speeds will soon cease to scale upwards and instead CPU manufacturers are planning to put more and more independent cores on a chip. Intel plans to release an 80-core chip within 5 years . Consequently the research Read More...

Posted Friday, September 07, 2007 8:11 PM by dcoetzee | 3 Comments

Filed under:

Robin's theorem
Most computer scientists are familiar with the P = NP problem, which asks essentially whether we can verify more problems in polynomial time than we can solve. So fundamentally does complexity theory hinge on this result that the Clay Mathematics Institute Read More...

Posted Monday, July 16, 2007 2:12 PM by dcoetzee | 2 Comments

Filed under:

Modular arithmetic and primality testing
Number theory is, roughly speaking, the study of properties of integers. Often a problem which is easy for real numbers, such as factoring or linear programming, seems to be considerably more difficult when restricted to integers (in fact, integer programming Read More...

Posted Wednesday, September 07, 2005 10:29 AM by dcoetzee | 7 Comments

Filed under: ,

Page view tracker