About accuracy of the solution of NP-complete tasks
arXiv:1409.8254
Abstract
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.
11 pages, 8 figures