At least there are upper complexity bounds like that :-) >
I should precise that the upper complexity bound is for the case in which the success rate is 100% at the optimum, which is clearly not the most realistic setting; I would say that the result also holds without this assumption, but I don't find a reference showing this (showing this mathematically I mean)...
_______________________________________________ Computer-go mailing list [email protected] http://dvandva.org/cgi-bin/mailman/listinfo/computer-go
