🌐EnglishEnglishFrançaisItalianoPortuguêsРусский한국어中文日本語EntityQ5421532· pop 6· linked from 57 articlesexponential time hypothesisAlso known as ETHunproven computational hardness assumption that 3-SAT isn’t solvable in subexponential time in the worst caseAvailable in 6 languages日本語РусскийPortuguêsItalianoSerbianvia Wikidata sitelinks · CC0Connectionstime complexityEntityboolean satisfiability problemEntityCategoriesComputational hardness assumptions