theoretical-computer-science / Computational Complexity, Closure Systems
A finite closure system can be given by implications or by a list of subsets closed under intersection. Deciding whether one specification of each kind defines the same family had remained open in several settings; the paper proves the problem coNP-complete.
Temporal state
No reconciled state yet.
Append-only history
A finite closure system can be given by implications or by a list of subsets closed under intersection. Deciding whether one specification of each kind defines the same family had remained open in several settings; the paper proves the problem coNP-complete.
Research memory
A finite closure system can be given by implications or by a list of subsets closed under intersection. Deciding whether one specification of each kind defines the same family had remained open in several settings; the paper proves the problem coNP-complete.
Evidence graph
No public relationships recorded yet.