Pages that link to "Item:Q555978"
From MaRDI portal
The following pages link to Approximation algorithms for NP-hard problems (Q555978):
Displaying 6 items.
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Approximate solution of NP optimization problems (Q672315) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Using small-scale quantum devices to solve algebraic equations (Q2690295) (← links)
- (Q4864960) (← links)
- Approximate counting and NP search problems (Q5055313) (← links)