“aequa”的评论
http://aequa.me
Programming on the shoulders of giants.Tue, 09 Jul 2019 07:51:40 +0000
hourly
1 https://wordpress.org/?v=5.2.2
Roundgod对《Counting independent sets in O(1.619^n) time》的评论
http://aequa.me/index.php/2019/06/03/counting-independent-sets-in-o1-619n-time/#comment-104
Sun, 07 Jul 2019 03:50:10 +0000http://aequa.me/?p=413#comment-104Actually, after sorting the vertices by decreasing order of degrees. when we encounter a leaf, we can solve the case in constant time. Therefore the recurrence becomes $T(n)\leq T(n-1)+T(n-3)$, which is so-called Narayana’s Cow Sequence and is bounded by $O(1.46558^n)$.
]]>