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.

Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets

Ricard Gavaldà, José L. Balcázar. Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. In Michal Chytil, Ladislav Janiga, Václav Koubek, editors, Mathematical Foundations of Computer Science 1988, MFCS 88, Carlsbad, Czechoslovakia, August 29 - September 2, 1988, Proceedings. Volume 324 of Lecture Notes in Computer Science, pages 300-308, Springer, 1988.

Abstract

Abstract is missing.

runs on