Computational hardness assumption
id:
computational-hardness-assumption-235-10316629
title:
Computational hardness assumption
text:
In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently. It is not known how to prove (unconditional) hardness for essentially any useful problem. Instead, computer scientists rely on reductions to formally relate the hardness of a new or complicated problem to a computational hardness assumption about a problem that is better-understood. Computational hardness assumptions are of particular importance in cry
brand slug:
wiki
category slug:
encyclopedia
description:
Hypothesis in computational complexity theory
original url:
https://en.wikipedia.org/wiki/Computational_hardness_assumption
date created:
date modified:
2023-12-20T22:38:16Z
main entity:
{"identifier":"Q5157320","url":"https://www.wikidata.org/entity/Q5157320"}
image:
fields total:
13
integrity:
14