Contents V.14 N.1 2023

  • ON THE COMPLEXITY OF THE BANDPASS PROBLEM
    MEHMET KURT, HAKAN KUTUCU, ARIF GURSOY, URFAT NURIYEV (pp. 41-49)
    10.30546/2219-1259.14.1.2023.41

    • Abstract.

    In 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 Decision Problem, and show that there is a one-to-one correspondence between the k-Satisfiability Decision Problem and the 1-Bandpass Decision Problem.

    Keywords:

    Bandpass Problem, satisfiability problem, complexity, restriction, NP-hard, NPcomplete.

    Contact Details

    Telephone:
    Email: twms.aliev@gmail.com
    Website: www.twmsj.az

    Z.Khalilov str., 23, AZ 1148,
    Baku
    AZERBAIJAN