Computer and intractability: a guide to the theory of...

Main
Mathematics
Computer and intractability: a guide to...

Computer and intractability: a guide to the theory of NP-completeness

Name: Computer and intractability: a guide to the theory of NP-completeness
ISBN: 9780716710448

Michael R. Garey, David S. Johnson

0 / 0

0 comments

Quanto ti piace questo libro?

Qual è la qualità del file?

Scarica il libro per la valutazione della qualità

Qual è la qualità dei file scaricati?

This book's introduction features a humorous story of a man with a line of people behind him, who explains to his boss, "I can't find an efficient algorithm, but neither can all these famous people. This man illustrates an important quality of a class of problems, namely, the NP-complete problems: if you can prove that a problem is in this class, then it has no known polynomial-time solution that is guaranteed to work in general. This quality implies that the problem is difficult to deal with in practice.

Categorie:

Mathematics

Anno:

1979

Casa editrice:

W.H.Freeman & Co Ltd

Lingua:

english

Pagine:

175

ISBN 10:

0716710447