APA (7th ed.) Citation
(2017). Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. Logical Methods in Computer Science.
Chicago Style (17th ed.) Citation
"Multiplicative-Additive Proof Equivalence Is Logspace-complete, via Binary Decision Trees." Logical Methods in Computer Science 2017.
MLA (9th ed.) Citation
"Multiplicative-Additive Proof Equivalence Is Logspace-complete, via Binary Decision Trees." Logical Methods in Computer Science, 2017.
Warning: These citations may not always be 100% accurate.