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]

Authors

Marc Bagnol

This author has not been identified. Look up 'Marc Bagnol' in Google