After reading a bit about SETH (the strong exponential time hypothesis), I see that a lot of lower bounds for problems in P can be proven if we assume SETH. But I notice that most of the ones that are proven are solved in quadratic time (or slower). I wonder if any linear or $O(n\ log(n))$ time problem can have a similar property?
Is this something we can ask/show? What do you think?
Thanks for any answers.