Optimization of convex geometries: component quadratic and general
| dc.contributor.author | Myrzakul, Zhanbota | |
| dc.date.accessioned | 2016-06-06T04:42:02Z | |
| dc.date.available | 2016-06-06T04:42:02Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | In this Capstone Project, we worked with a class of closure systems called convex geometries, which are closure systems with a closure operator that satisfies the anti-exchange property. We first looked at the result of optimization algorithm of component quadratic systems, which are discussed in [4], and reproved it for the case of convex geometries. We then investigated the following question: if a convex geometry is given by a set of implications, is it possible to find its optimum basis in polynomial time when the convex geometry does not have particular properties (for instance, not component quadratic)? | ru_RU |
| dc.identifier.citation | Myrzakul Zhanbota. 2016. Optimization of convex geometries: component quadratic and general. Nazarbayev University. School of Science and Technology. Mathematics Department. http://nur.nu.edu.kz/handle/123456789/1617 | ru_RU |
| dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/1617 | |
| dc.language.iso | en | ru_RU |
| dc.publisher | Nazarbayev University School of Science and Technology | |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
| dc.subject | Capstone Project | ru_RU |
| dc.subject | convex geometries | ru_RU |
| dc.title | Optimization of convex geometries: component quadratic and general | ru_RU |
| dc.type | Capstone Project | ru_RU |