The 8 Dedekind N. on 51 minutes.
-
Updated
Oct 28, 2020 - C
The 8 Dedekind N. on 51 minutes.
Inequivalent maximal antichains
C program what computes A132582. Extensible to any wide.
This repository contains two implementations of the algorithm to compute the ninth Dedekind number. It utilizes matrix multiplication.
Dedekind numbers and today fastest computers.
Add a description, image, and links to the dedekind-numbers topic page so that developers can more easily learn about it.
To associate your repository with the dedekind-numbers topic, visit your repo's landing page and select "manage topics."