DSpace at KOASAS
College of Engineering(공과대학)School of Computing(전산학부)CS-Conference Papers(학술회의논문)

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

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 434
  • Download : 0
Export
최승학 / 좌경룡researcher / 신성용researcher
Publisher
한국정보과학회
Issue Date
1991-01-01
Language
KOR
Citation

Proc. KISS Annual Conferene, pp.763 - 766

URI
http://hdl.handle.net/10203/108281
Appears in Collection
CS-Conference Papers(학술회의논문)CS-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

Display Full Item Record

qr_code

  • mendeley

    citeulike

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


rss_1.0 rss_2.0 atom_1.0