A quantitative analysis of OS noise
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
The implication problem for a class of dependencies is the following: given a finite set of dependencies, determine if they logically imply another dependency. The authors showed that the implication problem is undecidable for the class of functional and inclusion dependencies. This holds true even if the inclusion dependencies are restricted to be binary. It may be noted that the implication problem is known to be decidable for functional and unary inclusion dependencies and also for inclusion dependencies without functional dependencies.
Alessandro Morari, Roberto Gioiosa, et al.
IPDPS 2011
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
Rajiv Ramaswami, Kumar N. Sivarajan
IEEE/ACM Transactions on Networking