Prison Yard 문제의 계산 복잡도Computational Complexity of the Proson-yard Problem

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 325
  • Download : 0
DC FieldValueLanguage
dc.contributor.author최승학ko
dc.contributor.author신성용ko
dc.contributor.author좌경룡ko
dc.date.accessioned2013-02-27T18:31:41Z-
dc.date.available2013-02-27T18:31:41Z-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.created2012-02-06-
dc.date.issued1996-03-
dc.identifier.citation정보과학회논문지(A), v.23, no.3, pp.259 - 264-
dc.identifier.issn1226-2315-
dc.identifier.urihttp://hdl.handle.net/10203/70119-
dc.languageKorean-
dc.publisher한국정보과학회-
dc.titlePrison Yard 문제의 계산 복잡도-
dc.title.alternativeComputational Complexity of the Proson-yard Problem-
dc.typeArticle-
dc.type.rimsART-
dc.citation.volume23-
dc.citation.issue3-
dc.citation.beginningpage259-
dc.citation.endingpage264-
dc.citation.publicationname정보과학회논문지(A)-
dc.contributor.localauthor신성용-
dc.contributor.localauthor좌경룡-
dc.contributor.nonIdAuthor최승학-
dc.description.isOpenAccessN-
Appears in Collection
CS-Journal 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