Assertion: exponential time hypothesis | /r/HasProperty | formulated by paturi
Facets:
Source sentences:
text: In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by Impagliazzo & Paturi (1999).