{"version":"1.0","type":"link","title":"Exponential time hypothesis - Newikis","description":"In computational complexity theory, the exponential time hypothesis (ETH) states that satisfiability of 3-CNF Boolean formulas (3-SAT) cannot be solved in subexponential time, . More precisely, the usual form of the hypothesis asserts the existence of a number such that all algorithms that…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}