DISCUSSION OF NP-COMPLETENESS OF TABLE EQUIVALENCE

In this paper, several results of table equivalence decision are given:3-satisfiability problem, expression NP-completeness, and table NP-completeness. Also given and discussed are an effect of functional dependency on the table and strong equivalence complexity, thus providing the condition for the further study of tables.