About one class polynomial problems with not polynomial certificates
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.