The following pages link to Smoothed analysis of algorithms (Q3583576):
Displaying 50 items.
- Eigenvectors and controllability of non-Hermitian random matrices and directed graphs (Q2042849) (← links)
- Gaining traction: on the convergence of an inner approximation scheme for probability maximization (Q2045616) (← links)
- Algebraic Bayesian networks: checking backbone connectivity (Q2047545) (← links)
- Fast quantum subroutines for the simplex method (Q2061891) (← links)
- Asymptotic density and computability (Q2066410) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- Stabilize deep ResNet with a sharp scaling factor \(\tau\) (Q2102389) (← links)
- Smoothed analysis for tensor methods in unsupervised learning (Q2144543) (← links)
- Communication complexity of approximate Nash equilibria (Q2155907) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs (Q2188238) (← links)
- Counting frequent patterns in large labeled graphs: a hypergraph-based approach (Q2194034) (← links)
- Convex hulls of perturbed random point sets (Q2240861) (← links)
- The isotropic constant of random polytopes with vertices on convex surfaces (Q2274400) (← links)
- Iterative computation of security strategies of matrix games with growing action set (Q2292111) (← links)
- Moser's shadow problem (Q2327756) (← links)
- Optimizing MSE for clustering with balanced size constraints (Q2335035) (← links)
- Internet routing between autonomous systems: fast algorithms for path trading (Q2341707) (← links)
- On the efficiency of a randomized mirror descent algorithm in online optimization problems (Q2354481) (← links)
- Geometric random edge (Q2364496) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- Smoothed analysis of binary search trees (Q2371805) (← links)
- Mechanism design for policy routing (Q2375297) (← links)
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems (Q2413317) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP (Q2441587) (← links)
- Approximating independent set in perturbed graphs (Q2446304) (← links)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
- Bayesian incentive compatibility via matchings (Q2516250) (← links)
- Smoothed analysis for the conjugate gradient algorithm (Q2520124) (← links)
- Topology matters: smoothed competitiveness of metrical task systems (Q2566010) (← links)
- Phase transition of degeneracy in minor-closed families (Q2689167) (← links)
- Halting time is predictable for large models: a universality property and average-case analysis (Q2697399) (← links)
- On a condition number of general random polynomial systems (Q2792338) (← links)
- Smoothed Analysis on Connected Graphs (Q2947435) (← links)
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs (Q2957690) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- On the Most Likely Voronoi Diagram and Nearest Neighbor Searching (Q2988722) (← links)
- The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization (Q2988849) (← links)
- Lower Bounds for the Smoothed Number of Pareto Optimal Solutions (Q3010422) (← links)
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (Q3012799) (← links)
- Settling the Complexity of Local Max-Cut (Almost) Completely (Q3012803) (← links)
- Smooth analysis of the condition number and the least singular value (Q3160742) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- Asymptotic density, immunity and randomness (Q3195648) (← links)
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q3196427) (← links)
- A Worst-Case Analysis of Constraint-Based Algorithms for Exact Multi-objective Combinatorial Optimization (Q3305119) (← links)
- Quantitative invertibility of random matrices: a combinatorial perspective (Q3382245) (← links)
