Decidability of NP-complete problems (Q2686649)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7657708
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidability of NP-complete problems |
scientific article; zbMATH DE number 7657708 |
Statements
Decidability of NP-complete problems (English)
0 references
28 February 2023
0 references
NP-complete problems
0 references
Diophantine equations
0 references
non-deterministic algorithm
0 references
0.7689995765686035
0 references
0.7499911189079285
0 references
0.7456546425819397
0 references
0.7450245022773743
0 references
