ETH
A benchmark for evaluating agent capabilities. Specific details are not elaborated in the article; SharpLogic's online demonstration uses it as example code.
Timeline (last 90 days)
A preprint describes a deterministic algorithm that can exactly count the number of satisfying assignments of a certain class of KCNF formulas in subexponential time, which if valid would challenge the Exponential Time Hypothesis (ETH).
ETH was proposed by Russell Impagliazzo and Ramamohan Paturi, conjecturing that the 3SAT problem cannot be solved in subexponential time.
Zurich has eight companies selected for the Europe's Robotics 65 list, all with direct ties to ETH, usually founded in the form of spin-offs.
All Facts (3)
A preprint describes a deterministic algorithm that can exactly count the number of satisfying assignments of a certain class of KCNF formulas in subexponential time, which if valid would challenge the Exponential Time Hypothesis (ETH).
50%UnverifiedETH was proposed by Russell Impagliazzo and Ramamohan Paturi, conjecturing that the 3SAT problem cannot be solved in subexponential time.
50%UnverifiedZurich has eight companies selected for the Europe's Robotics 65 list, all with direct ties to ETH, usually founded in the form of spin-offs.
50%