Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/9225
Pełny rekord metadanych
Pole DC | Wartość | Język |
---|---|---|
dc.contributor.author | Fujiwara, Hiroshi | - |
dc.contributor.author | Watari, Hokuto | - |
dc.contributor.author | Yamamoto, Hiroaki | - |
dc.date.accessioned | 2020-06-10T11:23:43Z | - |
dc.date.available | 2020-06-10T11:23:43Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | Formalized Mathematics, Volume 28, Issue 1, Pages 89-92 | pl |
dc.identifier.issn | 1426-2630 | - |
dc.identifier.uri | http://hdl.handle.net/11320/9225 | - |
dc.description.abstract | The subset sum problem is a basic problem in the field of theoretical computer science, especially in the complexity theory [3]. The input is a sequence of positive integers and a target positive integer. The task is to determine if there exists a subsequence of the input sequence with sum equal to the target integer. It is known that the problem is NP-hard [2] and can be solved by dynamic programming in pseudo-polynomial time [1]. In this article we formalize the recurrence relation of the dynamic programming. | pl |
dc.description.sponsorship | This work was supported by JSPS KAKENHI Grant Numbers JP16K00033, JP17K00013 and JP17K00183. | pl |
dc.language.iso | en | pl |
dc.publisher | DeGruyter Open | pl |
dc.rights | Uznanie autorstwa-Na tych samych warunkach 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-sa/3.0/pl/ | * |
dc.subject | dynamic programming | pl |
dc.subject | subset sum problem | pl |
dc.subject | complexity theory | pl |
dc.title | Dynamic Programming for the Subset Sum Problem | pl |
dc.type | Article | pl |
dc.identifier.doi | 10.2478/forma-2020-0007 | - |
dc.description.Affiliation | Hiroshi Fujiwara - Shinshu University, Nagano, Japan | pl |
dc.description.Affiliation | Hokuto Watari - Nagano Electronics Industrial Co., Ltd., Chikuma, Japan | pl |
dc.description.Affiliation | Hiroaki Yamamoto - Shinshu University, Nagano, Japan | pl |
dc.description.references | Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1979. ISBN 0716710447. | pl |
dc.description.references | Richard M. Karp. Reducibility among combinatorial problems. In Miller et al. [3], pages 85–103. ISBN 978-1-4684-2001-2. doi:10.1007/978-1-4684-2001-2_9. | pl |
dc.description.references | Raymond E. Miller, James W. Thatcher, and Jean D. Bohlinger, editors. Complexity of Computer Computations, 1972. Springer US. ISBN 978-1-4684-2001-2. doi:10.1007/978-1-4684-2001-2_9. | pl |
dc.description.references | Wojciech A. Trybulec. Non-contiguous substrings and one-to-one finite sequences. Formalized Mathematics, 1(3):569–573, 1990. | pl |
dc.identifier.eissn | 1898-9934 | - |
dc.description.firstpage | 89 | pl |
dc.description.lastpage | 92 | pl |
dc.identifier.citation2 | Formalized Mathematics | pl |
Występuje w kolekcji(ach): | Formalized Mathematics, 2020, Volume 28, Issue 1 |
Pliki w tej pozycji:
Plik | Opis | Rozmiar | Format | |
---|---|---|---|---|
forma_2020_28_01_0007.pdf | 225,56 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL