Decidability of NP-Complete Problems

An analysis of the undecidability of Diophantine equations showed that problems of recognition of the properties of the NP class are decidable, i.e., a non-deterministic algorithm or exhaustive search at the problem input gives a positive or negative answer. For polynomial Diophantine equations, suc...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Cybernetics and systems analysis Jg. 58; H. 6; S. 914 - 916
Hauptverfasser:	Vagis, A. A., Gupal, A. M.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.11.2022 Springer Springer Nature B.V
Schlagworte:	Algorithms Analysis Artificial Intelligence Control Diophantine equation Mathematical analysis Mathematics Mathematics and Statistics Polynomials Processor Architectures Software Engineering/Programming and Operating Systems Systems Theory Diophantine equations NP-complete problems non-deterministic algorithm
ISSN:	1060-0396, 1573-8337
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!