A T=0(2^n/2), S=0(2^n/4) Algorithm for Certain NP-Complete Problems
In this paper we develop a general prupose algorithm that can solve a number of NP-complete problems in time T=0(2^n/2) and space S=0(2^n/4). The algorithm can be generalized to a family of algorithms whose time and space complexities are related by T*S^2=0(2^n). The problems it can handle are chara...
| Main Authors: | , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/148974 |