most citedAbout one class polynomial problems with not polynomial certificates

2 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing math.COShow all

1 paper · 1 filter

math.CO2012

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…