Pages that link to "Item:Q1367542"
From MaRDI portal
The following pages link to The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542):
Displaying 5 items.
- Sublinear P system solutions to NP-complete problems (Q6038691) (← links)
- Public Bayesian persuasion: being almost optimal and almost persuasive (Q6053476) (← links)
- The MaxSAT problem in the real-valued MV-algebra (Q6541163) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation (Q6592907) (← links)