Prison Yard 문제의 NP - completeness 증명Prison Yard Problem is NP - complete

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 440
  • Download : 0
DC FieldValueLanguage
dc.contributor.author최승학-
dc.contributor.author좌경룡-
dc.contributor.author신성용-
dc.date.accessioned2013-03-14T11:38:45Z-
dc.date.available2013-03-14T11:38:45Z-
dc.date.created2012-02-06-
dc.date.issued1991-01-01-
dc.identifier.citationProc. KISS Annual Conferene, v., no., pp.763 - 766-
dc.identifier.urihttp://hdl.handle.net/10203/108281-
dc.languageKOR-
dc.publisher한국정보과학회-
dc.titlePrison Yard 문제의 NP - completeness 증명-
dc.title.alternativePrison Yard Problem is NP - complete-
dc.typeConference-
dc.type.rimsCONF-
dc.citation.beginningpage763-
dc.citation.endingpage766-
dc.citation.publicationnameProc. KISS Annual Conferene-
dc.identifier.conferencecountrySouth Korea-
dc.identifier.conferencecountrySouth Korea-
dc.contributor.localauthor좌경룡-
dc.contributor.localauthor신성용-
dc.contributor.nonIdAuthor최승학-
Appears in Collection
CS-Conference Papers(학술회의논문)CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0