Gordon: If that were true then wouldn't there be a counter example to the NP hard results for both exact and approximate solutions? Bob ----- Original Message ----- From: "Gordon Hazen" <[EMAIL PROTECTED]> To: <[EMAIL PROTECTED]> Sent: Friday, May 11, 2001 7:49 PM Subject: Re: [UAI] how to evaluate approximate algorithms when exact solution is not available? > Empirical studies would be interesting. Why not run an exact algorithm if > one has huge amounts of time available? Because, as I understand it, > peformance for Gibbs is linear in problem size, whereas performance for an > exact algorithm is exponential in problem size. > > -- Gordon >
