Skip to content
Free planNo credit card requiredStart writing

other · OpenGrey (Institut de l'Information Scientifique et Technique) · 1993

On the complexity of some basic problems in computational convexity Containment problems

Gritzmann, P., Klee, V., Trier Univ. (Germany). Fachbereich 4 - Wirtschafts- und Sozialwissenschaften/Mathematik

Cited by 0Abstract and details only

Abstract

The present paper is the first part of a survey of computational convexity, a new area of applied mathematics which has crystallized aroud a variety of results, problems and applications that involve interactions among convex geometry, mathematical programming and computer science. This first part will begin with some general remarks on computational convexity and will then summarize three paradigmatic areas of the subject. However, its main focus is on recent results that are related to the basic problems of computing, approximating, or measuring the convex sets which, among those in a given class C, are the smallest that contain a given convex body K or are the largest contained in K

Cite this paper

APA 7

Gritzmann, P., Klee, V., & Sozialwissenschaften/Mathematik, T. U. G. F. W. U. (1993). On the complexity of some basic problems in computational convexity Containment problems. OpenGrey (Institut de l'Information Scientifique et Technique).

MLA 9

Gritzmann, P., et al. “On the complexity of some basic problems in computational convexity Containment problems.” OpenGrey (Institut de l'Information Scientifique et Technique), 1993.

Chicago

Gritzmann, P., V. Klee, and Trier Univ. (Germany). Fachbereich 4 - Wirtschafts- und Sozialwissenschaften/Mathematik. 1993. “On the complexity of some basic problems in computational convexity Containment problems.” OpenGrey (Institut de l'Information Scientifique et Technique).

Harvard

Gritzmann, P., Klee, V. and Sozialwissenschaften/Mathematik, T.U.G.F.W.U. (1993) ‘On the complexity of some basic problems in computational convexity Containment problems’, OpenGrey (Institut de l'Information Scientifique et Technique).

BibTeX
@misc{gritzmann1993complexity,
  title = {{On the complexity of some basic problems in computational convexity Containment problems}},
  author = {Gritzmann, P. and Klee, V. and Sozialwissenschaften/Mathematik, Trier Univ. (Germany). Fachbereich 4 - Wirtschafts- und},
  journal = {OpenGrey (Institut de l'Information Scientifique et Technique)},
  year = {1993}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.