Kurt, MehmetKutucu, HakanGursoy, ArifNuriyev, Urfat2024-09-292024-09-2920232076-25852219-1259https://doi.org/10.30546/2219-1259.14.1.2023.41https://hdl.handle.net/20.500.14619/7210In this paper, we prove that the Bandpass Problem is NP-hard by restriction from the Bandpass Problem to the Satisfiability Problem. Furthermore, we define the 1-Bandpass De-cision Problem, and show that there is a one-to-one correspondence between the k-Satisfiability Decision Problem and the 1-Bandpass Decision Problem.eninfo:eu-repo/semantics/closedAccessBandpass Problemsatisfiability problemcomplexityrestrictionNP-hardNP completeArticle10.30546/2219-1259.14.1.2023.414914114WOS:000983297900003Q1