Article
| Title: | On one NP-complete problem (English) |
| Author: | Demel, Jiří |
| Author: | Demlová, Marie |
| Language: | English |
| Journal: | Kybernetika |
| ISSN: | 0023-5954 |
| Volume: | 31 |
| Issue: | 2 |
| Year: | 1995 |
| Pages: | 207-211 |
| . | |
| Category: | math |
| . | |
| MSC: | 68Q15 |
| MSC: | 68Q25 |
| MSC: | 68T27 |
| idZBL: | Zbl 0859.68038 |
| idMR: | MR1334510 |
| . | |
| Date available: | 2009-09-24T18:54:34Z |
| Last updated: | 2012-06-06 |
| Stable URL: | http://hdl.handle.net/10338.dmlcz/124420 |
| . | |
| Reference: | [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 0519066 |
| Reference: | [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. |
| . |
Files
| Files | Size | Format | View |
|---|---|---|---|
| Kybernetika_31-1995-2_6.pdf | 285.6Kb | application/pdf |
View/ |
Search
Partner of
