Associated code for the paper "Level-p-complexity of Boolean Functions using Thinning, Memoization, and Polynomials" (under submission to JFP) by Julia and Patrik Jansson.
A preprint is available as arXiv:2302.02473 and the associated code is available as release tag/v2023-02.pre-print as the code continues to evolve.
- 2022-12: Patrik Jansson gave a talk at the 2012-12 online meeting of IFIP WG 2.1 on Algorithmic Languages and Calculi. The recording is available on YouTube and the slides here.
- 2023-03: Slides, YouTube recording