Geodesic
On one NP-complete problem
Kybernetika, Tome 31 (1995) no. 2, pp. 207-211 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 68Q15, 68Q25, 68T27 
@article{KYB_1995_31_2_a5,
     author = {Demel, Ji\v{r}{\'\i} and Demlov\'a, Marie},
     title = {On one {NP-complete} problem},
     journal = {Kybernetika},
     pages = {207--211},
     year = {1995},
     volume = {31},
     number = {2},
     mrnumber = {1334510},
     zbl = {0859.68038},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1995_31_2_a5/}
}
TY  - JOUR
AU  - Demel, Jiří
AU  - Demlová, Marie
TI  - On one NP-complete problem
JO  - Kybernetika
PY  - 1995
SP  - 207
EP  - 211
VL  - 31
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/KYB_1995_31_2_a5/
LA  - en
ID  - KYB_1995_31_2_a5
ER  - 
%0 Journal Article
%A Demel, Jiří
%A Demlová, Marie
%T On one NP-complete problem
%J Kybernetika
%D 1995
%P 207-211
%V 31
%N 2
%U http://geodesic.mathdoc.fr/item/KYB_1995_31_2_a5/
%G en
%F KYB_1995_31_2_a5
Demel, Jiří; Demlová, Marie. On one NP-complete problem. Kybernetika, Tome 31 (1995) no. 2, pp. 207-211. http://geodesic.mathdoc.fr/item/KYB_1995_31_2_a5/

[1] M.R. Garrcy, D. S. Johnson: Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman and Co., San Francisco 1979. | MR

[2] O. Štěpánková: An introduction to qualitative reasoning. In: Advanced Topics in Artificial Intelligence (V. Mařík, O. Štěpánková, and J. Trappl, eds.), (Lecture Notes in Artificial Intelligence 617), Springer Verlag 1992, pp. 404-418.