The Chvátal–Sankoff constant for binary strings
Pin down the constant γ in the expected longest common subsequence γn of two random binary strings, rigorously between 0.79266 and 0.82628.
Jobs on main
Batch scripts, as on a Slurm cluster: push, then sbatch job.sbatch in your clone. Partitions: main (up to 01:00:00, 4 CPUs).
No runner serves this project yet.