On the nonkeys

Vũ Đức Thi


In this paper we give some results about nonkeys. We show that for relation scheme the problem decide whether there is a nonkey having cardinality greater than or equal to a give integer m is NP-complete. However, for relation this problem can be solved by a polynomial time algorithm.


  • There are currently no refbacks.

Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology