An algorithm for checking the existence of LCP-maps between LCL-problems. Input the source and target problems in the files in the input folder in round eliminator format. The output is a map from representative tuples of active source configurations to active target tuples, and can be completed into an LCP-map by permutations.
-
Notifications
You must be signed in to change notification settings - Fork 0
An algorithm for checking the existence of LCP-maps between LCL-problems.
License
SelimV/LCP-finder
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An algorithm for checking the existence of LCP-maps between LCL-problems.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published