Back to Results
First PageMeta Content
Complexity classes / Proof theory / Structural complexity theory / Curry–Howard correspondence / Type theory / NP / Time complexity / Reduction / Linear logic / Theoretical computer science / Computational complexity theory / Applied mathematics


On Elementary Linear Logic and polynomial time (Extended Abstract) Patrick Baillot∗ ENS Lyon, Universit´e de Lyon, LIP (UMR 5668 CNRS-ENSL-INRIA-UCBL)
Add to Reading List

Document Date: 2015-05-05 07:12:16


Open Document

File Size: 238,20 KB

Share Result on Facebook
UPDATE