APA (7th ed.) Citation

Jansson, J., & Jansson, P. (2023). Level-p-complexity of Boolean functions using thinning, memoization, and polynomials. Journal of Functional Programming, 33, . https://doi.org/10.1017/S0956796823000102

Chicago Style (17th ed.) Citation

Jansson, Julia, and Patrik Jansson. "Level-p-complexity of Boolean Functions Using Thinning, Memoization, and Polynomials." Journal of Functional Programming 33 (2023). https://doi.org/10.1017/S0956796823000102.

MLA (9th ed.) Citation

Jansson, Julia, and Patrik Jansson. "Level-p-complexity of Boolean Functions Using Thinning, Memoization, and Polynomials." Journal of Functional Programming, vol. 33, 2023, https://doi.org/10.1017/S0956796823000102.

Warning: These citations may not always be 100% accurate.