국립중앙도서관 "우편 복사 서비스"로 연결 됩니다.
RISS
In this paper, we show that some graph-related NP-complete problems can be represented by Petri nets moldel and that the question for an NP-complete problem can be changed to a reachability problem for the corresponding Petri net. All problems in the ...
다국어 입력
あ
ぁ
か
が
さ
ざ
た
だ
な
は
ば
ぱ
ま
や
ゃ
ら
わ
ゎ
ん
い
ぃ
き
ぎ
し
じ
ち
ぢ
に
ひ
び
ぴ
み
り
う
ぅ
く
ぐ
す
ず
つ
づ
っ
ぬ
ふ
ぶ
ぷ
む
ゆ
ゅ
る
え
ぇ
け
げ
せ
ぜ
て
で
ね
へ
べ
ぺ
め
れ
お
ぉ
こ
ご
そ
ぞ
と
ど
の
ほ
ぼ
ぽ
も
よ
ょ
ろ
を
ア
ァ
カ
サ
ザ
タ
ダ
ナ
ハ
バ
パ
マ
ヤ
ャ
ラ
ワ
ヮ
ン
イ
ィ
キ
ギ
シ
ジ
チ
ヂ
ニ
ヒ
ビ
ピ
ミ
リ
ウ
ゥ
ク
グ
ス
ズ
ツ
ヅ
ッ
ヌ
フ
ブ
プ
ム
ユ
ュ
ル
エ
ェ
ケ
ゲ
セ
ゼ
テ
デ
ヘ
ベ
ペ
メ
レ
オ
ォ
コ
ゴ
ソ
ゾ
ト
ド
ノ
ホ
ボ
ポ
モ
ヨ
ョ
ロ
ヲ
―
http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
예시)
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
А
Б
В
Г
Д
Е
Ё
Ж
З
И
Й
К
Л
М
Н
О
П
Р
С
Т
У
Ф
Х
Ц
Ч
Ш
Щ
Ъ
Ы
Ь
Э
Ю
Я
а
б
в
г
д
е
ё
ж
з
и
й
к
л
м
н
о
п
р
с
т
у
ф
х
ц
ч
ш
щ
ъ
ы
ь
э
ю
я
′
″
℃
Å
￠
￡
￥
¤
℉
‰
＄
％
Ｆ
￦
㎕
㎖
㎗
ℓ
㎘
㏄
㎣
㎤
㎥
㎦
㎙
㎚
㎛
㎜
㎝
㎞
㎟
㎠
㎡
㎢
㏊
㎍
㎎
㎏
㏏
㎈
㎉
㏈
㎧
㎨
㎰
㎱
㎲
㎳
㎴
㎵
㎶
㎷
㎸
㎹
㎀
㎁
㎂
㎃
㎄
㎺
㎻
㎽
㎾
㎿
㎐
㎑
㎒
㎓
㎔
Ω
㏀
㏁
㎊
㎋
㎌
㏖
㏅
㎭
㎮
㎯
㏛
㎩
㎪
㎫
㎬
㏝
㏐
㏓
㏃
㏉
㏜
㏆
RISS 인기검색어
부가정보
다국어 초록 (Multilingual Abstract)
In this paper, we show that some graph-related NP-complete problems can be represented by Petri nets moldel and that the question for an NP-complete problem can be changed to a reachability problem for the corresponding Petri net. All problems in the paper are modeled with low level Petri nets.
Every modeling has been dine with polynomially bounded nimber of lpaces, transitions, arcs and initial tokens with respect to ｜V｜,｜E｜ and K if the original problem is specified with a graph G=(V,E) and a constant K.
Every modeling has been dine with polynomially bounded nimber of lpaces, transitions, arcs and initial tokens with respect to ｜V｜,｜E｜ and K if the original problem is specified with a graph G=(V,E) and a constant K.
In this paper, we show that some graph-related NP-complete problems can be represented by Petri nets moldel and that the question for an NP-complete problem can be changed to a reachability problem for the corresponding Petri net. All problems in the paper are modeled with low level Petri nets.
Every modeling has been dine with polynomially bounded nimber of lpaces, transitions, arcs and initial tokens with respect to ｜V｜,｜E｜ and K if the original problem is specified with a graph G=(V,E) and a constant K.
동일학술지(권/호) 다른 논문
-
- 東亞大學校 附設 情報通信硏究所
- 안기형
- 1997
-
- 東亞大學校 附設 情報通信硏究所
- 김주성
- 1997
-
- 東亞大學校 附設 情報通信硏究所
- 김창근
- 1997
-
HW/SW 통합설계를 위한 SpecCharts의 변환 기법
- 東亞大學校 附設 情報通信硏究所
- 김승권
- 1997
분석정보
이 자료와 함께 이용한 RISS 자료
나만을 위한 추천자료
