Title of article :
On NP-completeness in Linear Logic
Original Research Article
Author/Authors :
Alexey P. Kopylov، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1995
Abstract :
In this paper the questions remaining open about NP-completeness of multiplicative and Horn fragments of the Linear Logic and the Linear Logic with the weakening rule are answered.
Journal title :
Annals of Pure and Applied Logic
Journal title :
Annals of Pure and Applied Logic
