Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
| Hi-index | 0.89 |
We give a criterion for satisfiability of a boolean formula in conjunctive normal form by means of a multiple integral.