A T=O(2n/2), S=O(2n/4) Algorithm for Certain NP-Complete Problems

In this paper we develop a general-purpose algorithm that can solve a number of NP-complete problems in time $T = O(2^{n/2} )$ and space $S = O(2^{n/4} )$. The algorithm can be generalized to a fam...