Pages that link to "Item:Q4721084"
From MaRDI portal
The following pages link to Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084):
Displaying 8 items.
- Pseudo-Boolean optimization (Q697569) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
- Local optimization on graphs (Q1122503) (← links)
- Extending shelling orders and a hierarchy of functions of unimodal simple polytopes (Q1894364) (← links)
- Good polynomials for optimal LRC of low locality (Q2035459) (← links)
- An improvement algorithm based on local approximation of the attainable set. (Q2764323) (← links)
- On parallel versus sequential approximation (Q6102318) (← links)