# About one class polynomial problems with not polynomial certificates

@article{Kochkarev2012AboutOC, title={About one class polynomial problems with not polynomial certificates}, author={B. S. Kochkarev}, journal={ArXiv}, year={2012}, volume={abs/1210.7591} }

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.

## 3 Citations

Proof of the hypothesis Edmonds's, not polynomial of NPC-problems and classification of the problems with polynomial certificates

- MathematicsArXiv
- 2013

It is shown that all the $NP$-complete problems is not polynomial and the classification of the problems with thePolynomial certificates is given.

Problem of Recognition of Hamiltonian Graph

- Mathematics
- 2016

The author proposes an efficient algorithm for solving the problem of finding in combinatorial set of element with an easily recognizable property and proves the criterion of polynomiality of the formulated problem.

On One Class of Undirected Graph

- Mathematics
- 2017

Introduced the concept of polynomial combinatorial sets in enumerative combinatorics and formulates the problem of finding some element with an easily recognized symptom among elements of a…

## References

SHOWING 1-10 OF 15 REFERENCES

Admissible values of one parameter for maximal Sperner families of subsets of the type (k, k + 1)

- Mathematics
- 2008

AbstractIn this paper we generalize one assertion (obtained by us earlier) on admissible values of a certain parameter for partial maximal Sperner families (m. S. f.) of subsets of a finite set of…

Gipoteza J.Edmondsa i problema S.A.Kuka

- Vestnik TGGPU, (24),2,
- 2011

Prilojenie monotonnykh funktsij algebry logiki k probleme Kuka, Nauka v Vuzakh: matematika, fizika, informatika, Tezisy dokladov Mejdunarodnoj nauchno-obrazovatelnoj konferentsii,2009,pp.274-275

- 2009

On Cook’s problem, www.math.nsc.ru//simalglog/ses 2008e.html

- 2008

Structure Properties of a Certain Class of Maximal Sperner Families of Subsets, Russian Mathematics (Iz.VUZ

- 2005

Structural Properties of One Class of Maximal Sperner Families of Subsets of a Finite Set

- In Proceedings of International Conference, ”Logic and Applications” on the occasion of the 60th anniversary of the Academician Yu.l. Erchov, Novosibirsk,
- 2000

V . Vvedenie v diskretnuju matematiku

- 1986

Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions

- Computer Science
- 1969

Paths, Trees, and Flowers

- Mathematics
- 1965

A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An…