ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Open smoothed-analysis questions for the simplex method include: can the smoothed upper bound on the expected number of edges of a projected polyhedron match the \Theta(d^{3/2}\ln n) bound as \sigma\to\infty, and can one prove a lower bound depending on \sigma; can one analyze perturbing only a random \varepsilon-fraction of entries of (A,b); and can one obtain meaningful smoothed-complexity bounds for other pivot rules?

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.