| 書誌情報 | ファイル |
|---|
3正則グラフの巡回セールスマン問題に対する厳密アルゴリズムの改善(計算機科学の理論とその応用)
岩間, 一雄; 中島, 拓也 (2007-05)
数理解析研究所講究録, 1554: 145-152
|  |
Alternating CFG の拡張について(計算機科学の理論とその応用)
守屋, 悦朗; Otto, Friedrich; Messerschmidt, Hartmut (2007-05)
数理解析研究所講究録, 1554: 9-15
| |
Approximation Algorithm for Maximum Triangle Packing and Metric Maximum Clustering(Theory of Computer Science and Its Applications)
CHEN, Zhi-Zhong; Tanahashi, Ruka; Sekiyama, Tatsuyuki (2007-05)
数理解析研究所講究録, 1554: 71-77
| |
Branch-length とtree-length(計算機科学の理論とその応用)
梅澤, 香織; 山崎, 浩一 (2007-05)
数理解析研究所講究録, 1554: 230-237
| |
Confluence of Length Preserving String Rewriting Systems is Undecidable(Theory of Computer Science and Its Applications)
Wang, Yi; Sakai, Masahiko; Nishida, Naoki; Sakabe, Toshiki; Kusakari, Keiichirou (2007-05)
数理解析研究所講究録, 1554: 171-177
| |
DAG の高さを4以下に制限したタスクスケジューリングの近似アルゴリズムについて(計算機科学の理論とその応用)
清水, 豪樹; 大山口, 通夫; 山田, 俊行; 柳本, 貴之; 小松, 健悟 (2007-05)
数理解析研究所講究録, 1554: 210-216
| |
Decidability of Innermost Termination for Semi-Constructor Term Rewriting Systems(Theory of Computer Science and Its Applications)
Uchiyama, Keita; Sakai, Masahiro; Nishida, Naoki; Sakabe, Toshiki; Kusakari, Keiichirou (2007-05)
数理解析研究所講究録, 1554: 166-170
| |
Direct Binary Search 法によるマルチトニング(計算機科学の理論とその応用)
平野, 祐樹; 中野, 浩嗣 (2007-05)
数理解析研究所講究録, 1554: 161-165
| |
A Fast Algorithm for Computing Jones Polynomials of Montesinos Links(Theory of Computer Science and Its Applications)
Murakami, Masahiko; Hara, Masao; Yamamoto, Makoto; Tani, Seiichi (2007-05)
数理解析研究所講究録, 1554: 153-160
| |
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graph(Theory of Computer Science and Its Applications)
CHEN, Zhi-Zhong; Tanahashi, Ruka (2007-05)
数理解析研究所講究録, 1554: 78-84
| |
$K$- 開発閉包な左線形項書換えシステムの合流性(計算機科学の理論とその応用)
岩見, 宗弘 (2007-05)
数理解析研究所講究録, 1554: 258-263
| |
$k$-Set Agreement を解く故障検知器(計算機科学の理論とその応用)
坂田, 敦; 小野, 廣隆; 定兼, 邦彦; 山下, 雅史 (2007-05)
数理解析研究所講究録, 1554: 269-275
| |
A Lattice-Based Cryptosystem and Proof of Knowledge on Its Secret Key(Theory of Computer Science and Its Applications)
Xagawa, Keita; Kawachi, Akinori; Tanaka, Keisuke (2007-05)
数理解析研究所講究録, 1554: 40-47
| |
Negation-Limited Complexity of Parity and Inverters(Theory of Computer Science and Its Applications)
(2007-05)
数理解析研究所講究録, 1554: 131-138
| |
Neighborhood Function for CA(Theory of Computer Science and Its Applications)
Nishio, Hidenosuke; Worsch, Thomas (2007-05)
数理解析研究所講究録, 1554: 16-23
| |
Orthogonal Drawings for Plane Graphs with Specified Face Areas(Theory of Computer Science and Its Applications)
Kawaguchi, Akifumi; Nagamochi, Hiroshi (2007-05)
数理解析研究所講究録, 1554: 85-92
| |
Private Approximation of the Set Cover Problem : Extended Abstract(Theory of Computer Science and Its Applications)
Yashiro, Masatoshi; Tanaka, Keisuke (2007-05)
数理解析研究所講究録, 1554: 48-55
| |
Ptolemaic Graph 上の最長路問題に関する研究(計算機科学の理論とその応用)
高原, 祥浩; 寺本, 幸生; 上原, 隆平 (2007-05)
数理解析研究所講究録, 1554: 109-116
| |
Quantum Asymmetric-Key Cryptosystems Secure Against Computationally Unbounded Adversaries(Theory of Computer Science and Its Applications)
Kawachi, Akinori; Portmann, Christopher (2007-05)
数理解析研究所講究録, 1554: 117-124
| |
Variations on Neighborhoods in CA(Theory of Computer Science and Its Applications)
Worsch, Thomas; Nishio, Hidenosuke (2007-05)
数理解析研究所講究録, 1554: 24-31
| |
