Pages that link to "Item:Q2753732"
From MaRDI portal
The following pages link to On the hardness of approximating \({\mathcal N}{\mathcal P}\) witnesses (Q2753732):
Displaying 6 items.
- Fast local search methods for solving limited memory influence diagrams (Q895537) (← links)
- Intractability and approximation of optimization theories of cognition (Q2438604) (← links)
- ON THE PROOF COMPLEXITY OF THE NISAN–WIGDERSON GENERATOR BASED ON A HARD <font>NP</font> ∩ <font>coNP</font> FUNCTION (Q3094358) (← links)
- Optimal indecomposable witnesses without extremality or the spanning property (Q3165233) (← links)
- Hamming Approximation of NP Witnesses (Q3191592) (← links)
- (Q5005177) (← links)