Sensitivity diagnostics has recently been put high on the agenda of methodological research into Qualitative Comparative Analysis (QCA). Existing studies in this area rely on the technique of exhaustive enumeration, and the majority of works examine the reactivity of QCA either only to alterations in discretionary parameter values or only to data quality. In this article, we introduce the technique of combinatorial computation for evaluating the interaction effects between two problems afflicting data quality and two discretionary parameters on the stability of QCA reference solutions. In this connection, we challenge a hitherto unstated assumption intrinsic to exhaustive enumeration, show that combinatorial computation permits the formulation of general laws of sensitivity in QCA, and demonstrate that our technique is most efficient.