Solvability of NP-complete problems
Saved in:
| Date: | 2022 |
|---|---|
| Main Authors: | O. A. Vahis, A. M. Hupal |
| Format: | Article |
| Language: | English |
| Published: |
2022
|
| Series: | Cybernetics and Systems Analysis |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0001368550 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Examples of Complete Solvability of 2D Classical Superintegrable Systems
by: Chen, Y., et al.
Published: (2015) -
NP-hardness of collective pursuiting optimization problems
by: Pashko, S.V.
Published: (2025) -
Determination of Groups of Risks at the Diseases COVID-19
by: O. A. Vahis, et al.
Published: (2020) -
On complete and quasi-complete two-criteria optimization problems on graphs
by: V. A. Perepelitsa, et al.
Published: (2018) -
On the solvability of the stochastic Helmholtz problem
by: M. I. Tleubergenov, et al.
Published: (2019)