IIMA Institutional Repository
This Institutional Repository has been created to collect, preserve and distribute the scholarly output of Indian Institute of Management, Ahmedabad. This will work as an important tool to facilitate scholarly communication and preserve the institution knowledge. The Vikram Sarabhai Library is proud to be hosting the repository for the dissemination and preservation of this valuable knowledge resource of the IIMA community.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/7776Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Rao, V. Venkata | - |
| dc.date.accessioned | 2010-08-20T03:42:52Z | - |
| dc.date.available | 2010-08-20T03:42:52Z | - |
| dc.date.copyright | 2000 | - |
| dc.date.issued | 2010-08-20T03:42:52Z | - |
| dc.identifier.uri | http://hdl.handle.net/11718/7776 | - |
| dc.description.abstract | This 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.iso | en | en |
| dc.subject | Computer and Information Systems | en |
| dc.title | Computational Complexity | en |
| dc.type | Cases and Notes | en |
| 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.