A Characterization of NP Within Interval-Valued Computing

Simple item page
dc.contributor.authorNagy, Benedek
dc.contributor.authorValyi, Sandor
dc.date.accessioned2026-02-06T18:28:27Z
dc.date.issued2015
dc.departmentDoğu Akdeniz Üniversitesi
dc.description7th International Conference on Machines, Computations and Universality (MCU) -- SEP 09-11, 2015 -- Famagusta, CYPRUS
dc.description.abstractIn this paper, a syntactic subclass of polynomial size intervalvalued computations is given that characterizes NP, that is, exactly languages with non-deterministically polynomial time complexity can be decided by interval-valued computations of this subclass. This subclass refrains from using product and shift operators aside from a starting section of the computation.
dc.description.sponsorshipEastern Mediterranean Univ
dc.identifier.doi10.1007/978-3-319-23111-2_11
dc.identifier.endpage179
dc.identifier.isbn978-3-319-23111-2
dc.identifier.isbn978-3-319-23110-5
dc.identifier.issn0302-9743
dc.identifier.scopus2-s2.0-84945530101
dc.identifier.scopusqualityQ3
dc.identifier.startpage164
dc.identifier.urihttps://doi.org/10.1007/978-3-319-23111-2_11
dc.identifier.urihttps://hdl.handle.net/11129/10949
dc.identifier.volume9288
dc.identifier.wosWOS:000363670900011
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer-Verlag Berlin
dc.relation.ispartofMachines, Computations, and Universality, Mcu 2015
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.subjectUnconventional computing
dc.subjectInterval-valued computing
dc.subjectComplexity
dc.subjectNP
dc.subjectcoNP
dc.subjectDeterministic computing
dc.titleA Characterization of NP Within Interval-Valued Computing
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu