Fix #109: Add LCS to MaximumIndependentSet reduction#173
Fix #109: Add LCS to MaximumIndependentSet reduction#173zazabap wants to merge 7 commits intoCodingThrust:mainfrom
Conversation
Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
- Change complexity from 2^total_length to (total_length/num_strings)^num_strings reflecting the standard DP algorithm O(∏n_i) - Assert exact LCS length (4) in three-string test instead of loose range Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Add problem-def for LongestCommonSubsequence and reduction-rule for LCS → MaximumIndependentSet with worked example and proof. Co-Authored-By: Claude Opus 4.6 <noreply@anthropic.com>
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## main #173 +/- ##
==========================================
+ Coverage 96.88% 96.89% +0.01%
==========================================
Files 200 204 +4
Lines 27537 27855 +318
==========================================
+ Hits 26680 26991 +311
- Misses 857 864 +7 ☔ View full report in Codecov by Sentry. 🚀 New features to boost your workflow:
|
|
On Hold: Branch is severely out of date with main (11 merge conflicts in core files including Plan: Close this PR and reimplement issue #109 fresh on current main using Additionally, the DOI corrections and overhead expression fixes flagged in the issue quality check should be addressed in the reimplementation. |
Summary
Closes #109