A geometrical method in combinatorial complexity

DOI10.21136/AM.1981.103900MaRDI QIDQ3902478zbMATH OpenOpenAlexFDO

Authors Jaroslav Morávek

Publication date 1981

Full work available at URL https://eudml.org/doc/15185

zbMATH Keywords

decomposition of polyhedral sets into convex setsknapsack problemlower bound for the number of comparisons

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Dynamic Programming Approach to Sequencing Problems
• A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
• A note upon minimal path problem
• A sorting problem and its complexity
• Bounds on Threshold Gate Realizability
• Dynamic Programming Treatment of the Travelling Salesman Problem
• scientific article; zbMATH DE number 3112450 (Why is no real title available?)
• scientific article; zbMATH DE number 3564333 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3314811 (Why is no real title available?)
• scientific article; zbMATH DE number 3330531 (Why is no real title available?)
• scientific article; zbMATH DE number 3385535 (Why is no real title available?)
• On the complexity of discrete programming problems
• Solving production smoothing problems
• Time bounds for selection

This page was built for publication: A geometrical method in combinatorial complexity

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