"On the Computational Complexity of Cut-Elimination in Linear Logic."

Harry G. Mairson, Kazushige Terui (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-45208-9_4

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/ictcs/MairsonT03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ictcs/MairsonT03
Harry G. Mairson, Kazushige Terui:
On the Computational Complexity of Cut-Elimination in Linear Logic. ICTCS 2003: 23-36

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.