| Article ID: | iaor19888 |
| Country: | Germany |
| Volume: | 24 |
| Start Page Number: | 515 |
| End Page Number: | 519 |
| Publication Date: | Jun 1988 |
| Journal: | Elektronische Informationsverarbeitung und Kybernetik |
| Authors: | Demetrovics Jnos, Thi Vu Duc |
The main purpose of this paper is to prove that for a given relation there exists a deterministic polynomial time algorithm which decides whether an arbitrary attribute is prime or not. A necessary condition for a minimal relation representing a given Sperner system is also given.