On one NP-complete problem

Jiří Demel; Marie Demlová

Kybernetika (1995)

  • Volume: 31, Issue: 2, page 207-211
  • ISSN: 0023-5954

How to cite


Demel, Jiří, and Demlová, Marie. "On one NP-complete problem." Kybernetika 31.2 (1995): 207-211. <http://eudml.org/doc/27575>.

author = {Demel, Jiří, Demlová, Marie},
journal = {Kybernetika},
keywords = {production rule},
language = {eng},
number = {2},
pages = {207-211},
publisher = {Institute of Information Theory and Automation AS CR},
title = {On one NP-complete problem},
url = {http://eudml.org/doc/27575},
volume = {31},
year = {1995},

AU - Demel, Jiří
AU - Demlová, Marie
TI - On one NP-complete problem
JO - Kybernetika
PY - 1995
PB - Institute of Information Theory and Automation AS CR
VL - 31
IS - 2
SP - 207
EP - 211
LA - eng
KW - production rule
UR - http://eudml.org/doc/27575
ER -


  1. M.R. Garrcy, D. S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman and Co., San Francisco 1979. (1979) MR0519066
  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. (1992) 

NotesEmbed ?


You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.


Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.