Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/139313
Title: | Application of dynamic programming in the minimal superpermutation problem | Authors: | Ong, Linus Hong Jun | Keywords: | Science::Mathematics::Applied mathematics | Issue Date: | 2020 | Publisher: | Nanyang Technological University | Abstract: | We show our attempts to bound the minimal superpermutation on n symbols using dynamic programming, namely a variant of the Held{Karp algorithm. A reduction of the search space by introducing certain restrictions to was also done to improve the running time. | URI: | https://hdl.handle.net/10356/139313 | Fulltext Permission: | restricted | Fulltext Availability: | With Fulltext |
Appears in Collections: | SPMS Student Reports (FYP/IA/PA/PI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
U1540913C_OngHongJunLinus_FinalThesis.pdf Restricted Access | 405.95 kB | Adobe PDF | View/Open |
Page view(s)
286
Updated on Feb 6, 2023
Download(s) 50
39
Updated on Feb 6, 2023
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.