A Java implementation of Not the Maximum Segment Sum problem. Please read the document for details of this problem Not the Maximum Segment sum
Not the Maximum Segment Sum (NMSS for short) problem is an interesting problem from the context of [1]. In this short report I introduce how to compute NMSS problem in liner time and also introduce some concepts and skills of functional programming (FP). As a related topic the Maximum Segment Sum problem has been studied by many researchers [2-4].
- [1]Richard Bird. Pearls of Functional Algorithm Design. Cambridge University Press, New York, NY, USA, 1st edition, 2010.
- [2] M. Cole. Parallel Programming, List Homomorphisms and the Maximum Segment Sum Problems. Report {csr}-25-93, Department of Computing Science, The University of Edinburgh, 1993.
- [3] Kazutaka Morita, Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, and Masato Takeichi. Automatic inversion generates divide-and-conquer parallel programs. In ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation (PLDI 2007), pages 146–155. ACM Press, jun 2007.
- [4] Z. Hu, H.Iwasaki, M.Takeichi. Formal Derivation of Parallel Program for 2-Dimensional Maximum Segment Sum Problem. In Annual European Conference on Parallel Processing, LNCS 1123, pages 553–562. Springer Verlag, 1996.