Patrik Jansson

Professor of Computer Science

Curriculum vitae

+46317725415

Computer Science and Engineering

Chalmers University of Technology

Room number: EDIT-6452
My office is in the EDIT building of campus Johanneberg, near Rännvägen 6.

Level-p-complexity of Boolean functions using thinning, memoization, and polynomials

Journal article

Julia Jansson, Patrik Jansson
Journal of Functional Programming, vol. 33, 2023

DOI: 10.1017/S0956796823000102

Cite

APA Click to copy
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/Turabian Click to copy
Jansson, Julia, and Patrik Jansson. “Level-p-Complexity of Boolean Functions Using Thinning, Memoization, and Polynomials.” Journal of Functional Programming 33 (2023).

MLA Click to copy
Jansson, Julia, and Patrik Jansson. “Level-p-Complexity of Boolean Functions Using Thinning, Memoization, and Polynomials.” Journal of Functional Programming, vol. 33, 2023, doi:10.1017/S0956796823000102.

BibTeX Click to copy

@article{julia2023a,
  title = {Level-p-complexity of Boolean functions using thinning, memoization, and polynomials},
  year = {2023},
  journal = {Journal of Functional Programming},
  volume = {33},
  doi = {10.1017/S0956796823000102},
  author = {Jansson, Julia and Jansson, Patrik}
}

The paper is available on the JFP homepage and as a pre-print on arXiv:2302.02473.

The associated source code is available on GitHub as BoFunComplexity.