A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Information and Computation
Intuitionistic Light Affine Logic
ACM Transactions on Computational Logic (TOCL)
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Lambda calculus characterizations of poly-time
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Soft linear logic and polynomial time
Theoretical Computer Science - Implicit computational complexity
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Soft Linear Logic and Polynomial Complexity Classes
Electronic Notes in Theoretical Computer Science (ENTCS)
An exact correspondence between a typed pi-calculus and polarised proof-nets
Theoretical Computer Science
Non-deterministic Boolean proof nets
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
An Implicit Characterization of PSPACE
ACM Transactions on Computational Logic (TOCL)
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
| Hi-index | 0.00 |
This paper relates two distinct traditions: the one of complexity classes characterisations through light logics and models of nondeterminism. Light logics provide an implicit characterisation of P-Time algorithms through the Curry-Howard isomorphism: every derivation reduces to its normal form in polynomial time and every polynomial Turing machine can be simulated by a derivation. In this paper, we extend Intuitionistic Light Affine Logic, a logic with full weakening, with a simple rule for nondeterminism and get a completeness result for NP-Time algorithms which is, as far as we know, the first Curry-Howard characterisation of NP complexity. We conclude by a reformulation of the P ≠ NP conjecture.