2 citations · 3 across the 3 of their papers we have counts for
3 papers
cs.DM2013
Typical property of one class of combinatory objects and estimation from above corresponding combinatory numbers
B. S. Kochkarev
We investigate properties of families of subsets of a finite set in a situation where subsets are incomparable by the binary inclusion relation and a) for any , ther…
cs.CC2013★ 1 cited
Proof of the hypothesis Edmonds's, not polynomial of NPC-problems and classification of the problems with polynomial certificates
B. S. Kochkarev
We show that the affirmation (in computer science) erroneously and we prove the justice of the hypotesis J.Edmonds's . We show further that all the -c…
math.GM2012★ 2 cited
About one class polynomial problems with not polynomial certificates
B. S. Kochkarev
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 ele…