Nondeterministic light logics and NP-time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2701, Issue , 2003, Pages 241-255

  Maurel, François ^a  

^a Paris 7   (France)

Author keywords

Implicit characterisations of complexity classes; Light logics; NP complexity

Indexed keywords

BIOMINERALIZATION; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; TURING MACHINES;

AFFINE LOGIC; COMPLEXITY CLASS; CURRY-HOWARD; CURRY-HOWARD ISOMORPHISM; NON-DETERMINISM; NORMAL FORM; POLYNOMIAL-TIME; TIME ALGORITHMS;

CHARACTERIZATION;

EID: 9544255591     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44904-3_17     Document Type: Article

References (18)

1. Asperti A., Light Affine Logic. LICS98, 1998.
2. Asperti A., Roversi L., Intuitionistic Light Affine Logic. ACM Transactions on Computational Logic, 2002.
3. Baillot P., Stratified coherent spaces: a denotational semantics for Light Linear Logic. ICC00, 2000.
4. Bellantoni S., Cook S., A new recursion-theoretic characterisation of the polytime functions. Computational Complexity, 1992.
5. Ehrhard T., Regnier L., The Differential Lambda-Calculus. 2001.
6. Girard J.-Y., Proof-nets: the parallel syntax for proof-theory. Logic and Algebra, eds Ursini and Agliano, Marcel Dekker, New York 1996.
7. Girard J.-Y., Light Linear Logic. Information and Computation, 1998.
8. Girard J.-Y., Locus Solum. Mathematical Structures in Computer Science 11(3), 2001.
9. Hofmann M., Linear types and non-size increasing polynomial time computation. To appear in TCS, 1999.
10. Kanovich M. I., Okada M., Scedrov A., Phase semantics for light linear logic. Technical report, 1997.
11. Lafont Y., Soft Linear Logic and Polynomial Time. To appear in TCS.
12. Laurent O., Polarized games. Seventeenth annual IEEE symposium on Logic In Computer Science, IEEE Computer Society, 2002.
13. Leivant D., Marion J.Y., Lambda calculus characterisations of poly-time. TLCA 1993.
14. Murawski A. S., Ong C.-H. L., Can safe recursion be interpreted in light logic?. Second International Workshop on Implicit Computational Complexity, 2000.
15. Papadimitriou C., Computational complexity. Addison Wesley, 1994.
16. Roversi L., A P-Time Completeness Proof for Light Logics. CSL99, 1999.
17. Roversi L., Flexible Affine Light Logic. Submitted, 2001.
18. Terui K., Light Affine Calculus and Polytime Strong Normalisation. LICS01, 2001.