Skip to content

About

No description, website, or topics provided.

Resources

Stars

3 stars

Watchers

2 watching

Forks

Latest commit

 

History

84 Commits

Folders and files

Repository files navigation

Work in progress on converting known results on the minimal superpermutation problem into computer-verifiable proofs checkable with Coq. Main results proven so far are in Bounds.v.

Tested in Coq 8.5.0 through 8.8.2. May require changes to work in future versions.

ListTheorems.v and NumPermutations.v must be compiled for the results in Bounds.v to go through:

coqc ListTheorems.v
coqc NumPermutations.v

About

No description, website, or topics provided.

Resources

Stars

3 stars

Watchers

2 watching

Forks

Releases

Packages

Contributors

Languages