Decidability of NP-complete problems

DOI10.1007/S10559-023-00524-YOpenAlexW4313551347MaRDI QIDQ2686649

A. A. Vagis, Anatol M. Gupal

Publication date: 28 February 2023

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-023-00524-y

zbMATH Keywords

NP-complete problemsDiophantine equationsnon-deterministic algorithm

Mathematics Subject Classification ID

General logic (03Bxx) Mathematical logic and foundations (03-XX) Computability and recursion theory (03Dxx)

Cites Work

• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of NP-complete problems