scientific article; zbMATH DE number 3858831

zbMATH Open0539.90052MaRDI QIDQ3328253FDOQ3328253

Authors: Jaroslav Morávek 

Publication date: 1983

Title of this publication is not available (Why is that?)

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

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)

Cited In (9)

• A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
• Lower bounds on probabilistic linear decision trees
• Power of decision trees with monotone queries
• Some lower bounds for the complexity of the linear programming feasibility problem over the reals
• The decision tree polytope and its application to sequential decision problems
• Title not available (Why is that?)
• Decision tree complexity and Betti numbers
• Title not available (Why is that?)
• Title not available (Why is that?)

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)