Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Max I. Kanovich. Horn Programming in Linear Logic Is NP-Complete. In Proceedings, Seventh Annual IEEE Symposium on Logic in Computer Science, 22-25 June 1992, Santa Cruz, California, USA. pages 200-210, IEEE Computer Society, 1992.
Possibly Related PublicationsThe following publications are possibly variants of this publication: Petri Nets, Horn Programs, Linear Logic, and Vector GamesMax I. Kanovich. tacs 1994: 642-666 Petri Nets, Horn Programs, Linear Logic and Vector GamesMax I. Kanovich. APAL, 75(1-2):107-135, 1995.
The following publications are possibly variants of this publication: