Re: [boost] BGL: max clique?

From: Phlip (pplumlee_at_[hidden])
Date: 2001-03-04 14:49:33

Proclaimed David Abrahams from the mountaintops:

> A previous poster has implied that this problem is proven NP-complete. That
> means that if your algorithmicist has a polynomial solution, (s)he is about
> to revolutionize computation. I guess in your shoes I would be preparing
> myself to realize I had overlooked something ;-)

I thought "NP-complete" meant "solvable in polynomial time". Pretend I meant 
whatever response curve will not rock your world ;-)

Believe me I'm having a lot harder time learning all this pre-existing AI 
literature than typing in what our algorithmicist comes up with.

-- 
  Phlip                          phlip_cpp_at_[hidden]
============== http://phlip.webjump.com ==============
  --  Friends don't let friends use Closed Source software  --