Pages that link to "Item:Q380664"
From MaRDI portal
The following pages link to Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664):
Displaying 6 items.
- Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
- The complexity of approximation reoptimization algorithms for discrete optimization (Q1797554) (← links)
- Polynomial threshold reoptimization of generalized satisfiability problems with bounded arity predicates (Q2850118) (← links)
- Approximation to the reoptimization optimal sublinear algorithms of bounded-degree problems of a general feasibility (Q2850154) (← links)
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems (Q2986889) (← links)
