ON THE COMPLEXITY OF THE BANDPASS PROBLEM

Basit Öğe Kaydı
dc.authoridGursoy, Arif/0000-0002-0747-9806
dc.authoridNuriyev, Urfat/0000-0002-3337-5859
dc.contributor.authorKurt, Mehmet
dc.contributor.authorKutucu, Hakan
dc.contributor.authorGursoy, Arif
dc.contributor.authorNuriyev, Urfat
dc.date.accessioned2024-09-29T16:07:50Z
dc.date.available2024-09-29T16:07:50Z
dc.date.issued2023
dc.departmentKarabük Üniversitesien_US
dc.description.abstractIn 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.en_US
dc.identifier.doi10.30546/2219-1259.14.1.2023.41
dc.identifier.endpage49en_US
dc.identifier.issn2076-2585
dc.identifier.issn2219-1259
dc.identifier.issue1en_US
dc.identifier.startpage41en_US
dc.identifier.urihttps://doi.org/10.30546/2219-1259.14.1.2023.41
dc.identifier.urihttps://hdl.handle.net/20.500.14619/7210
dc.identifier.volume14en_US
dc.identifier.wosWOS:000983297900003en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherInst Applied Mathematicsen_US
dc.relation.ispartofTwms Journal of Pure and Applied Mathematicsen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectBandpass Problemen_US
dc.subjectsatisfiability problemen_US
dc.subjectcomplexityen_US
dc.subjectrestrictionen_US
dc.subjectNP-harden_US
dc.subjectNP completeen_US
dc.titleON THE COMPLEXITY OF THE BANDPASS PROBLEMen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu