Pages that link to "Item:Q1255780"

The following pages link to Linear programming is log-space hard for P (Q1255780):

Displayed 26 items.

• Two complexity results on \(c\)-optimality in experimental design (Q429521) ‎ (← links)
• Approximating linear programming is log-space complete for P (Q750289) ‎ (← links)
• Prediction-preserving reducibility (Q756441) ‎ (← links)
• Depth-first search is inherently sequential (Q1062456) ‎ (← links)
• An introduction to parallelism in combinatorial optimization (Q1076605) ‎ (← links)
• The parallel complexity of deadlock detection (Q1091805) ‎ (← links)
• Parallel search algorithms in global optimization (Q1114315) ‎ (← links)
• Parallel approximation algorithms for bin packing (Q1123807) ‎ (← links)
• \(\varepsilon\)-productions in context-free grammars (Q1148693) ‎ (← links)
• The maximum flow problem is log space complete for P (Q1165000) ‎ (← links)
• An appraisal of computational complexity for operations researchers (Q1173532) ‎ (← links)
• Expressing combinatorial optimization problems by linear programs (Q1186549) ‎ (← links)
• A canonical form for generalized linear constraints (Q1186697) ‎ (← links)
• Learning in parallel (Q1187024) ‎ (← links)
• Algorithms and complexity analysis for some flow problems (Q1317482) ‎ (← links)
• On renamable Horn and generalized Horn functions (Q1356207) ‎ (← links)
• Gainfree Leontief substitution flow problems (Q1802953) ‎ (← links)
• Polynomial size linear programs for problems in \textsc{P} (Q2312647) ‎ (← links)
• Classifying the computational complexity of problems (Q3781088) ‎ (← links)
• The lexicographically first maximal subgraph problems:P-completeness andNC algorithms (Q4729355) ‎ (← links)
• THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) ‎ (← links)
• The complexity of linear programming (Q5904560) ‎ (← links)
• The complexity of linear programming (Q5904897) ‎ (← links)
• On the parallel approximability of a subclass of quadratic programming. (Q5941277) ‎ (← links)
• On the complexity of scheduling unrelated parallel machines with limited preemptions (Q6161912) ‎ (← links)
• Various approaches to multiobjective linear programming problems with interval costs and interval weights (Q6166935) ‎ (← links)