This repository contains two implementations of the algorithm to compute the ninth Dedekind number. It utilizes matrix multiplication.
-
Updated
Aug 5, 2023 - C++
#
dedekind-numbers
Here are 6 public repositories matching this topic...
The 8 Dedekind N. on 51 minutes.
-
Updated
Oct 28, 2020 - C
Inequivalent maximal antichains
-
Updated
Nov 27, 2022 - Jupyter Notebook
C program what computes A132582. Extensible to any wide.
-
Updated
Oct 28, 2020 - C
Dedekind numbers and today fastest computers.
c openmp parallel-computing inmemory combinatorics mit-license maths oeis pc-building number-theory hpc-systems lattices oeis-database systems-design multicore-processors 64-bits dedekind-numbers overclocking-tuning fastest-execution-engine i7-11700
-
Updated
Dec 29, 2021
Improve this page
Add a description, image, and links to the dedekind-numbers topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the dedekind-numbers topic, visit your repo's landing page and select "manage topics."