On the nonkeys

Vũ Đức Thi
Author affiliations

Authors

  • Vũ Đức Thi Publishing House for Science and Technology

DOI:

https://doi.org/10.15625/1813-9663/13/1/7979

Abstract

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.

Metrics

Metrics Loading ...

Published

30-03-2016

How to Cite

[1]
V. Đức Thi, “On the nonkeys”, JCC, vol. 13, no. 1, pp. 11–15, Mar. 2016.

Issue

Section

Computer Science

Most read articles by the same author(s)

<< < 1 2 3 4