Nearly linear time

Machine models and linear time complexity

ACM SIGACT News

Constant time factors do matter

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Lower bounds on the complexity of recognizing SAT by turing machines

Information Processing Letters

Nonerasing, counting, and majority over the linear time hierarchy

Information and Computation

Note: a descriptive complexity approach to the linear hierarchy

Theoretical Computer Science

Graph properties checkable in linear time in the number of vertices

Journal of Computer and System Sciences

Time-space lower bounds for satisfiability

Journal of the ACM (JACM)

Improving exhaustive search implies superpolynomial lower bounds

Proceedings of the forty-second ACM symposium on Theory of computing