In this article, we present an algorithm to compute the 9th Dedekind Number. The key aspects are the use of matrix multiplication and symmetries in the free distributive lattice, which are detected with techniques from Formal Concept Analysis.
> The problem: The calculation of these terms on normal processors is slow and also the use of GPUs as currently the fastest hardware accelerator technology for many AI applications is not efficient for this algorithm. > https://arxiv.org/pdf/2304.03039.pdf At this rate, a…
Interestingly, the same result has been achieved by a single person, Christian Jäkel of TU Dresden: https://arxiv.org/abs/2304.00895
jayhoonView on HNParent context
> The problem: The calculation of these terms on normal processors is slow and also the use of GPUs as currently the fastest hardware accelerator technology for many AI applications is not efficient for this algorithm. > https://arxiv.org/pdf/2304.03039.pdf At this rate, a…
vlovich123View on HNParent context