External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

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.

Horn Programming in Linear Logic Is NP-Complete

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.

Abstract

Abstract is missing.

runs on