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