scientific article; zbMATH DE number 3858831

MaRDI QIDQ3328253zbMATH OpenFDO

Authors Jaroslav Morávek

Publication date 1983

zbMATH Keywords

complexity of linear programminglinear decision tree modeldecision computational problempolyhedral membership problem

Mathematics Subject Classification ID

Linear programming (90C05) Trees (05C05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3952498
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals
• Linear Programming in O([n3/ln n]L) Operations
• scientific article; zbMATH DE number 176776
• On the complexity of linear programming in the BSS-model

Cited in

(9)

• Lower bounds on probabilistic linear decision trees
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals
• scientific article; zbMATH DE number 1700041 (Why is no real title available?)
• scientific article; zbMATH DE number 6123089 (Why is no real title available?)
• Decision tree complexity and Betti numbers
• Power of decision trees with monotone queries
• A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
• scientific article; zbMATH DE number 3952498 (Why is no real title available?)
• The decision tree polytope and its application to sequential decision problems

This page was built for publication:

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