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.

Polynomially Bounded Minimization Problems which are Hard to Approximate

Viggo Kann. Polynomially Bounded Minimization Problems which are Hard to Approximate. In Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson, editors, Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings. Volume 700 of Lecture Notes in Computer Science, pages 52-63, Springer, 1993.

Abstract

Abstract is missing.

runs on