hardnessOfBeatingRandom
P145847
predicate
Indicates how difficult it is to defeat or outperform something when its behavior or outcome is determined randomly.
Sample triples (1)
| Subject | Object |
|---|---|
| Max-E3-LIN-2 | it is NP-hard to approximate better than 1/2 + ε for some ε > 0 under standard assumptions ⓘ |