# Computational hardness assumption

**computational hardness assumptionscomputational securityhardassumptioncomputational assumptionscomputational hardnesscomputationally difficulthardnesshardness assumptionproblems**

In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where efficiently typically means "in polynomial time").wikipedia

0 Related Articles

No Results Found!