We study approximation hardness and satisfiability of bounded
occurrence uniform instances of SAT. Among other things, we prove
the inapproximability for SAT instances in which every clause has
exactly 3 literals and each variable occurs exactly 4 times,
and display an explicit approximation lower bound for this problem.
We also provide a tighter characterization of the uniformly
bounded occurence instances which are surely satisfiable.