Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/7776
Full metadata record
DC FieldValueLanguage
dc.contributor.authorRao, V. Venkata-
dc.date.accessioned2010-08-20T03:42:52Z-
dc.date.available2010-08-20T03:42:52Z-
dc.date.copyright2000-
dc.date.issued2010-08-20T03:42:52Z-
dc.identifier.urihttp://hdl.handle.net/11718/7776-
dc.description.abstractThis note introduces the notions of computational complexity, and the theory of NP Completeness in an informal and non-rigorous way. In designing decision support systems, the designers often use heuristics. For such designers, the ideas presented here provide sufficient conceptual clarity, and help them decide under which conditions and contexts, heuristic can be designed. The note focusses on optimization problems. It introduces Big-O notation, the classes P and NP of optimization problems, Cook’‘s theorem, and discusses how to prove that a problem is NP Complete.en
dc.language.isoenen
dc.subjectComputer and Information Systemsen
dc.titleComputational Complexityen
dc.typeCases and Notesen
Appears in Collections:Cases and Notes

Files in This Item:
There are no files associated with this item.


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.