The complexity of finite functions
Handbook of theoretical computer science (vol. A)
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Bounded arithmetic, propositional logic, and complexity theory
Bounded arithmetic, propositional logic, and complexity theory
Introduction to the Theory of Computation: Preliminary Edition
Introduction to the Theory of Computation: Preliminary Edition
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
IEEE Annals of the History of Computing
| Hi-index | 0.00 |
In a preceding paper an NP-complete problem has been discussed pertaining to a function, called "core function", which plays an important role in the well known Boolean satisfiability problem (see the first item in the references list). In this paper, some theorems concerning the minimal Boolean implementation of the core function are proved.