On the complexity of the extreme points decision problem

DOI10.1016/0020-0190(91)90017-CMaRDI QIDQ1183448zbMATH OpenOpenAlexFDO

Authors Xiaodong Wang

Publication date 28 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90017-c

zbMATH Keywords

lower boundalgebraic-decision-tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Complexity of extremal set decision problem
• On Extreme Point Programming Problem
• Extremal CSPs
• scientific article; zbMATH DE number 4152172
• scientific article; zbMATH DE number 3858855
• scientific article; zbMATH DE number 3939126
• A problem in enumerating extreme points, and an efficient algorithm for one class of polytopes
• On the complexity of solution extension of optimization problems
• On the complexity of the search of an extremum of a function
• scientific article; zbMATH DE number 4156224

Cites work

• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• A Lower Bound to Finding Convex Hulls
• Lower bounds for algebraic decision trees

This page was built for publication: On the complexity of the extreme points decision problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1183448)