Affordable Access

Publisher Website

Encoding Hamiltonian circuits into multiplicative linear logic

Authors
Journal
Theoretical Computer Science
0304-3975
Publisher
Elsevier
Publication Date
Volume
266
Identifiers
DOI: 10.1016/s0304-3975(00)00381-9
Disciplines
  • Mathematics

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.