3SUM Hard Problems

Can the class of 3SUM hard problems be solved in subquadratic time? These problems can be reduced from the problem of determining whether, given three sets of integers, $A$, $B$, and $C$ with total size $n$, there are elements $a \in A$, $b \in B$, and $c \in C$ such that $a+b=c$.