%0 Journal Article
%T About accuracy of the solution of NP-complete tasks
%A Rustem Valeyev
%J Computer Science
%D 2014
%I arXiv
%X On example of tasks of class NP the questions concerning accuracy of work of already existing and possible in the future algorithms for the solution of tasks on discrete structures are considered.
%U http://arxiv.org/abs/1409.8254v1