Recursively Undecidable Properties of NP
We show that there cannot be any algorithm that for a given nondeterministic polynomial-time Turing machine determinates whether or not the language recognized by this machine belongs to P
cs.CC↗
arXiv subjects
V. G. Naidenko
Publications and source records attributed to V. G. Naidenko.
On some optimization problems for star-free graphs
It is shown that in star-free graphs the maximum independent set problem, the minimum dominating set problem and the minimum independent dominating set problem are approximable up to constant factor by any maximal independent set.
cs.CC↗