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
Citácia podle Chicago (17th ed.)Jansson, Julia, a 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.
Citácia podľa MLA (8th ed.)Jansson, Julia, a 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.
Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..