Knapp, C. and Noble, S. (2025) “The Complexity of the Greedoid Tutte Polynomial”, The Electronic Journal of Combinatorics, 32(3), p. P3.3. doi: 10.37236/11718.