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

Sun, 01 Jan 2017 00:00:00 +0100

Marc Bagnol:
Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. CoRR abs/1707.00991 (2017)