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.

The Concurrency Complexity for the Horn Fragment of Linear Logic

Sergey Dudakov. The Concurrency Complexity for the Horn Fragment of Linear Logic. In Sergei I. Adian, Anil Nerode, editors, Logical Foundations of Computer Science, 4th International Symposium, LFCS 97, Yaroslavl, Russia, July 6-12, 1997, Proceedings. Volume 1234 of Lecture Notes in Computer Science, pages 78-87, Springer, 1997.

Abstract

Abstract is missing.

runs on