About accuracy of the solution of NP-complete tasks
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.