The following pages link to (Q4829029):
Displaying 13 items.
- Smoothed analysis of condition numbers and complexity implications for linear programming (Q623362) (← links)
- Some remarks on the condition number of a real random square matrix (Q652451) (← links)
- Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
- Conditioning of random conic systems under a general family of input distributions (Q1029212) (← links)
- Computational complexity of kernel-based density-ratio estimation: a condition number analysis (Q1945037) (← links)
- Smoothed analysis of binary search trees (Q2371805) (← links)
- Beyond the worst-case analysis of random priority: smoothed and average-case approximation ratios in mechanism design (Q2672280) (← links)
- A smooth perceptron algorithm (Q2910893) (← links)
- Smoothed Analysis on Connected Graphs (Q2947435) (← links)
- Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803) (← links)
- Smoothed Analysis of Local Search Algorithms (Q3449848) (← links)
- (Q5111230) (← links)
- A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)
