Re:The Ball-of-Mud Transition, or how software gets complex
by ColinWright on Monday October 14, 2013 @09:19AM
(#6547043)
That's true, but I'm unaware of much work being done on the error bounds for small N (for some concept of small). I started on this during my PhD, but rapidly moved onto other problems that seemed more tractable, and never really returned to it. The results of Bollobás, Erdős, Rényi, and others, are mostly asymptotic. They do, however, seem remarkably good even on graphs of small size (under 10^6 vertices).
[ Parent
| on HN ]
Re:The Ball-of-Mud Transition, or how software gets complex
by JulianMorrison on Monday October 14, 2013 @11:24AM
(#6547740)
Those names make me wonder if mathematicians are arranged in series - Erdos, Erdós, Erdős, ...