Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees

Marc Bagnol. Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. Logical Methods in Computer Science, 13(4), 2017. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: