Developing for Developers

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

July, 2007

  • Developing for Developers

    Robin's theorem

    • 2 Comments
    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...
Page 1 of 1 (1 items)