veriscs good first issues (Lean)

Prove a faster implementation equivalent to Executable.solve 17 days ago

help wanted

0

First executable, machine-checked (Lean 4) 2-approximation for Shortest Common Superstring — a verified reference/oracle, packaged from openai/math family 128

Lean

#algorithms#approximation-algorithms#bioinformatics#formal-verification#lean4#shortest-common-superstring#theorem-proving#verified-software

Add measured benchmark instances beyond the current suite 17 days ago

help wanted good first issue

buberlo/veriscs

0

First executable, machine-checked (Lean 4) 2-approximation for Shortest Common Superstring — a verified reference/oracle, packaged from openai/math family 128

Lean

#algorithms#approximation-algorithms#bioinformatics#formal-verification#lean4#shortest-common-superstring#theorem-proving#verified-software

Add a small instance where greedy is longer than the exact optimum 17 days ago

help wanted good first issue

buberlo/veriscs

0

First executable, machine-checked (Lean 4) 2-approximation for Shortest Common Superstring — a verified reference/oracle, packaged from openai/math family 128

Lean

#algorithms#approximation-algorithms#bioinformatics#formal-verification#lean4#shortest-common-superstring#theorem-proving#verified-software

Review IsCommonSuperstring and opt against the classical SCS problem 17 days ago

help wanted good first issue

buberlo/veriscs

0

First executable, machine-checked (Lean 4) 2-approximation for Shortest Common Superstring — a verified reference/oracle, packaged from openai/math family 128

Lean

#algorithms#approximation-algorithms#bioinformatics#formal-verification#lean4#shortest-common-superstring#theorem-proving#verified-software

buberlo/veriscs

Open Issues Need Help