External Links

Cite Key

Statistics

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

PDF

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.

Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets

Lane A. Hemachandra. Algorithms from Complexity Theory: Polynominal-Time Operations for Complex Sets. In Tetsuo Asano, Toshihide Ibaraki, Hiroshi Imai, Takao Nishizeki, editors, Algorithms, International Symposium SIGAL 90, Tokyo, Japan, August 16-18, 1990, Proceedings. Volume 450 of Lecture Notes in Computer Science, pages 221-231, Springer, 1990.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.

runs on