The following pages link to (Q3050157):
Displaying 50 items.
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Some lower bounds for the complexity of the linear programming feasibility problem over the reals (Q998976) (← links)
- Open problems in computational linear algebra (Q999481) (← links)
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region (Q1003486) (← links)
- Approximated consistency for the automatic recording constraint (Q1010285) (← links)
- Multiline addressing by network flow (Q1016524) (← links)
- The \(C^m\) norm of a function with prescribed jets. II (Q1017346) (← links)
- Variations on a theme by Akl and Taylor: security and tradeoffs (Q1041239) (← links)
- Linear programming under randomness and fuzziness (Q1051559) (← links)
- The vertices of the knapsack polytope (Q1056676) (← links)
- Threshold hypergraphs (Q1057879) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- Intelligent gradient search in linear programming (Q1071647) (← links)
- Small solutions of linear diophantine equations (Q1074620) (← links)
- A 71/60 theorem for bin packing (Q1083194) (← links)
- Homotopy techniques in linear programming (Q1091937) (← links)
- Karmarkar's algorithm and the ellipsoid method (Q1095025) (← links)
- Scheduling jobs with fixed start and end times (Q1098765) (← links)
- A multiplicative barrier function method for linear programming (Q1101008) (← links)
- Probabilistic satisfiability (Q1104751) (← links)
- New trends in machine scheduling (Q1107428) (← links)
- A relaxed version of Karmarkar's method (Q1108926) (← links)
- A polynomial-time algorithm, based on Newton's method, for linear programming (Q1108927) (← links)
- The complexity of recognizing polyhedral scenes (Q1109582) (← links)
- Eliminating columns in the simplex method for linear programming (Q1113797) (← links)
- Minimal ellipsoids and their duals (Q1120829) (← links)
- An extension of Karmarkar's projective algorithm for convex quadratic programming (Q1121792) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- A polynomial-time algorithm for a class of linear complementarity problems (Q1123139) (← links)
- The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant (Q1127362) (← links)
- A note on Khatchian's algorithm (Q1133460) (← links)
- Multiobjective network scheduling with efficient use of renewable and nonrenewable resources (Q1150305) (← links)
- Is binary encoding appropriate for the problem-language relationship? (Q1163860) (← links)
- On the combinatorial problems which I would most like to see solved (Q1164626) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- Complexity of computations in Commutative Division of the USSR Academy of Sciences (Q1173942) (← links)
- A class of linear complementarity problems solvable in polynomial time (Q1174838) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Correlation polytopes: Their geometry and complexity (Q1176573) (← links)
- Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus (Q1180816) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- Temporal constraint networks (Q1182161) (← links)
- The complexity of problems involving structurally bounded and conservative Petri nets (Q1183417) (← links)
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals (Q1185456) (← links)
- A canonical form for generalized linear constraints (Q1186697) (← links)
- Learning in parallel (Q1187024) (← links)
- The complexity of stochastic games (Q1187025) (← links)
