2 citations · 3 across the 4 of their papers we have counts for
4 papers
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…
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…
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…
Absolutely symmetric trees and complexity of natural number
B. S. Kochkarev
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees wit…