We develop a new notion called {\it (1 − ) -tester for a set M of functions} f : A C . A (1 − ) -tester for M maps each element a A to a finite number of elements B a = b 1 b t B in a smaller sub-domain B A where for every f M if f ( a ) = 0 then f ( b ) = 0 for at least (1 − ) fraction of the elements b of B a . I.e., if f ( a ) = 0 then Pr b B a [ f ( b ) = 0 ] 1 − . The {\it size} of the (1 − ) -tester is max a A B a . The goal is to minimize this size, construct B a in deterministic almost linear time and access and compute each map in poly-log time.

We use tools from elementary algebra and algebraic function fields to build (1 − ) -testers of small size in deterministic almost linear time. We also show that our constructions are locally explicit, i.e., one can find any entry in the construction in time poly-log in the size of the construction and the field size. We also prove lower bounds that show that the sizes of our testers and the densities are almost optimal.

Testers were used in [Bshouty, Testers and its application, ITCS 2014] to construct almost optimal perfect hash families, universal sets, cover-free families, separating hash functions, black box identity testing and hitting sets. The dense testers in this paper shows that such constructions can be done in almost linear time, are locally explicit and can be made to be dense.