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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.