메뉴 건너뛰기




Volumn 2597, Issue , 2003, Pages 388-399

Decision P systems and the P≠NP conjecture

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

EID: 35248887086     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36490-0_27     Document Type: Article
Times cited : (11)

References (8)
  • 6
    • 0036190847 scopus 로고    scopus 로고
    • Simulating Turing Machines by P Systems with External Output
    • Romero-Jiménez, A.; Pérez-Jiménez, M.J.: Simulating Turing Machines by P Systems with External Output, Fundamenta Informaticae, 49(1-3), 2002, 273-287.
    • (2002) Fundamenta Informaticae , vol.49 , Issue.1-3 , pp. 273-287
    • Romero-Jiménez, A.1    Pérez-Jiménez, M.J.2
  • 7
    • 0002359374 scopus 로고    scopus 로고
    • Solving NP-Complete Problems Using P Systems with Active Membranes
    • (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), Springer-Verlag, London
    • Zandron, C.; Ferretti, C.; Mauri, G.: Solving NP-Complete Problems Using P Systems with Active Membranes, in Unconventional Models of Computation (I. Antoniou, C.S. Calude, M.J. Dinneen, eds.), Springer-Verlag, London, 2000, 289-301.
    • (2000) Unconventional Models of Computation , pp. 289-301
    • Zandron, C.1    Ferretti, C.2    Mauri, G.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.