![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 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](https://www.pdfsearch.io/img/3f9f97f8ce47a4699178e3a8bf9ef371.jpg) Date: 2015-05-05 07:12:16Complexity 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 ListSource URL: www.cs.swan.ac.ukDownload Document from Source Website File Size: 238,20 KBShare Document on Facebook
|