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

Marc Bagnol (2017)

> Home

Details and statistics

DOI: 10.23638/LMCS-13(4:20)2017

access: open

type: Journal Article

metadata version: 2020-06-18

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/lmcs/Bagnol17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/lmcs/Bagnol17
Marc Bagnol:
Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees. Log. Methods Comput. Sci. 13(4) (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.