格子巡回セールスマン問題の近似解法について(計算機科学の基礎理論)
スポンサーリンク
概要
著者
関連論文
- Commutation and Centralizers in Clone Theory (Algebras, Languages, Algorithms in Algebraic Systems and Computations)
- Centralizers and Monoids in Mathematical Clone Theory (New Aspects of Theoretical Computer Science)
- Galois Connection between Clones and Full Monoids (New Developments of Theory of Computation and Algorithms)
- 多値論理関数の本質的極小閉集合(計算機科学の基礎理論とその応用)
- 3値論理関数の閉集合の束について (多値論理およびその応用)
- 多値論理関数の極小閉集合 (計算の複雑性に関する研究)
- オンライン計算に於ける領域計算量 (数理情報科学の基礎理論と応用)
- On Gigantic Pairs of Minimal Clones (Models of Computation and Algorithms)
- Maximal Centralizing Monoids and Minimal Clones (Algebras, Languages, Algorithms and Computations)
- On minimal clones and generating polynomials (理論計算機科学の深化--新たな計算世界観を求めて RIMS研究集会報告集)
- Polynomials Generating Minimal Clones on a Finite Field (計算理論とアルゴリズムの新展開 RIMS研究集会報告集)
- Prelude to Local Complexity Theory
- A METHOD TO COMPUTE LOWER BOUNDS ON CIRCUIT-SIZE COMPLEXITY(Complexity Theory and Related Topics)
- 格子巡回セールスマン問題の近似解法について(計算機科学の基礎理論)
- 計算量の理論
- Centralizing Monoids with Minimal Function Witnesses on a Three-Element Set (Algebraic Systems and Theoretical Computer Science)
- Report on Centralizing Monoids on a Three-Element Set (Clone Theory and Discrete Mathematics・Algebra and Logic Related to Computer Science)
- Galois Connections arising in Clone Theory (Algebra and Computer Science)