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.

Fast Algorithms for N-Dimensional Restrictions of Hard Problems

Friedhelm Meyer auf der Heide. Fast Algorithms for N-Dimensional Restrictions of Hard Problems. In Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, 6-8 May 1985, Providence, Rhode Island, USA. pages 413-420, ACM, 1985.

Abstract

Abstract is missing.

runs on