Before revision:  We show that problems of this kind can be solved with roughly O(n^{24/13}) constant-degree polynomial sign tests . This is a considerable improvement, given the 3SUM-hardness of the triangle similarity problem that we discuss and the lack of any subquadratic algorithm for it (or for any similar problem) in the uniform model .
After revision:  We show that problems of this kind can be solved with roughly O(n^{24/13}) constant-degree polynomial sign tests .