The following pages link to (Q3096713):
Displayed 7 items.
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← 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)
- Vertical perimeter versus horizontal perimeter (Q1643390) (← links)
- Three candidate plurality is stablest for small correlations (Q5154790) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
- Interactions of computational complexity theory and mathematics (Q6198725) (← links)