Equivalence Testing: An O(log log n)-query Fully Adaptive Algorithm | HackerNoonThe proposed algorithm achieves an O(log log n) sample complexity while maintaining full adaptivity, which is a notable improvement in the field.