scientific article; zbMATH DE number 2119754
From MaRDI portal
Publication:4829029
zbMATH Open1058.65062MaRDI QIDQ4829029FDOQ4829029
Authors: John Dunagan, Avrim Blum 
Publication date: 29 November 2004
Title of this publication is not available (Why is that?)
Recommendations
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Linear programming (90C05)
Cited In (17)
- Smoothed analysis of condition numbers and complexity implications for linear programming
- A simple polynomial-time rescaling algorithm for solving linear programs
- Smoothed Analysis on Connected Graphs
- A smooth perceptron algorithm
- Settling the complexity of local max-cut (almost) completely
- Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time
- Smoothed analysis of binary search trees
- Smoothed and average-case approximation ratios of mechanisms: beyond the worst-case analysis
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis
- Some remarks on the condition number of a real random square matrix
- A deterministic and polynomial modified perceptron algorithm
- Smoothed Analysis of Integer Programming
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design
- Smoothed analysis of probabilistic roadmaps
- Smoothed analysis of termination of linear programming algorithms
- Smoothed analysis of local search algorithms
- Conditioning of random conic systems under a general family of input distributions
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 Q4829029)
