Marc Bagnol. Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. Logical Methods in Computer Science, 13(4), 2017. [doi]
@article{Bagnol17,
title = {Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees},
author = {Marc Bagnol},
year = {2017},
doi = {10.23638/LMCS-13(4:20)2017},
url = {https://doi.org/10.23638/LMCS-13(4:20)2017},
researchr = {https://researchr.org/publication/Bagnol17},
cites = {0},
citedby = {0},
journal = {Logical Methods in Computer Science},
volume = {13},
number = {4},
}