A polynomial algorithm for some instances of NP-complete problems (Q6963631)
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 8060005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for some instances of NP-complete problems |
scientific article; zbMATH DE number 8060005 |
Statements
A polynomial algorithm for some instances of NP-complete problems (English)
0 references
7 July 2025
0 references
feasibility criteria
0 references
convex optimization
0 references
non-convex optimization
0 references
quadratic programming
0 references
0 references
