论文信息 - Encoding Hamiltonian circuits into multiplicative linear logic

Encoding Hamiltonian circuits into multiplicative linear logic

We give a new proof of the NP-completeness of multiplicative linear logic without constants by a direct encoding of the Hamiltonian circuit decision problem.

Virgile Mogbil | Thomas Krantz

[1] Jean-Yves Girard,et al. Linear logic: its syntax and semantics , 1995 .

[2] J. A. Bondy,et al. Graph theory and related topics : proceedings of the conference held in honour of Professor W. T. Tutte on the occasion of his sixtieth birthday, University of Waterloo, July 5-9, 1977 , 1979 .

[3] J. Girard,et al. Advances in Linear Logic , 1995 .

[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5] Mati Pentus. Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear Logic , 1997, LFCS.

[6] Max I. Kanovich. Horn programming in linear logic is NP-complete , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[7] Vincent Danos,et al. The structure of multiplicatives , 1989, Arch. Math. Log..

[8] Andre Scedrov,et al. The Undecidability of Second Order Multiplicative Linear Logic , 1996, Inf. Comput..

[9] Yves Lafont. The Undecidability of Second Order Linear Logic Without Exponentials , 1996, J. Symb. Log..