Fundamentals of Computation Theory
From MaRDI portal
Publication:5492912
DOI10.1007/11537311zbMATH Open1122.68750OpenAlexW2491671784MaRDI QIDQ5492912FDOQ5492912
Authors: Daniel A. Spielman 
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Recommendations
- scientific article; zbMATH DE number 1962932
- Smoothed analysis of algorithms and heuristics: progress and open questions
- Smoothed analysis of local search algorithms
- Smoothed analysis of the successive shortest path algorithm
- Smoothed analysis of the successive shortest path algorithm
- Smoothed Analysis of Integer Programming
- Smoothed analysis of integer programming
Cited In (8)
- Smoothed analysis of algorithms
- Smoothed Analysis on Connected Graphs
- Smoothed Analysis on Connected Graphs
- Smoothed analysis of binary search trees
- Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
- A sequential smoothing algorithm with linear computational cost
- Approximate real symmetric tensor rank
- A smoothed GPY sieve
This page was built for publication: Fundamentals of Computation Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492912)
