Encoding Hamiltonian circuits into multiplicative linear logic

Authors:
Thomas Krantz;Virgile Mogbil
Affiliations:
Institut de Mathematiques de Luminy, Marseille, France;Institut de Mathematiques de Luminy, Marseille, France
Venue:
Theoretical Computer Science
Year:
2001

Citing 4
Cited 0

Linear logic: its syntax and semantics

Proceedings of the workshop on Advances in linear logic
The undecidability of second order multiplicative linear logic

Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear Logic

LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.