Serang (Subset Sum The Subset-Sum Problem): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
No edit summary
Tags: Manual revert Reverted
No edit summary
Tag: Manual revert
 
Line 27: Line 27:
== Year ==  
== Year ==  


2014
2015


== Reference ==  
== Reference ==  


https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0091507
https://www.liebertpub.com/doi/10.1089/cmb.2015.0013

Latest revision as of 09:16, 28 April 2023

Time Complexity

$\tilde{O}(n max(S))$

Space Complexity

$O(t logt)$

(https://dl.acm.org/doi/pdf/10.1145/3329863, Table 1)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2015

Reference

https://www.liebertpub.com/doi/10.1089/cmb.2015.0013