Algorithms development for financial problems
A challenging task, spanning across various industries in the modern world, is to solve complex practical problems classified as NP-hard. NP-hard stands for Non deterministic Polynomial-time hard. It represents a class of problems that are computationally intractable, implying that it is overwhelmin...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Final Year Project |
語言: | English |
出版: |
2009
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/18371 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |