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.

A # P-Complete Problem over Arithmetical Trees

Giancarlo Mauri, Nicoletta Sabadini. A # P-Complete Problem over Arithmetical Trees. In Egidio Astesiano, Corrado Böhm, editors, CAAP 81, Trees in Algebra and Programming, 6th Colloquium, Genoa, Italy, March 5-7, 1981, Proceedings. Volume 112 of Lecture Notes in Computer Science, pages 308-315, Springer, 1981.

Abstract

Abstract is missing.

runs on