  We build a class of polynomial problems with not polynomial certificates. The
parameter concerning which are defined efficiency of corresponding algorithms
is the number $n$ of elements of the set has used at construction of
combinatory objects (families of subsets) with necessary properties.
