derandomizationImplication
P161738
predicate
Indicates that one result or assumption about derandomization leads logically to, or has consequences for, another result or property in computational complexity.
Sample triples (2)
| Subject | Object |
|---|---|
|
complexity class BPP
surface form:
BPP
|
BPP = P if sufficiently strong pseudorandom generators exist ⓘ |
|
complexity class BPP
surface form:
BPP
|
BPP = P under certain circuit lower bound assumptions ⓘ |