|
|
|
|
|
Tapani Toivonen and Markku Tukiainen
Many combinatorial optimization problems are often considered intractable to solve exactly or by approximation. An example of such a problem is maximum clique, which?under standard assumptions in complexity theory?cannot be solved in sub-exponential time...
ver más
|
|
|
|
|