About one class polynomial problems with not polynomial certificates
General Mathematics
2013-02-22 v1 Discrete Mathematics
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 of elements of the set has used at construction of combinatory objects (families of subsets) with necessary properties.
Cite
@article{arxiv.1210.7591,
title = {About one class polynomial problems with not polynomial certificates},
author = {B. S. Kochkarev},
journal= {arXiv preprint arXiv:1210.7591},
year = {2013}
}