A planted solution model for the MAX-2SAT problem (情報物理学の数学的構造--RIMS研究集会報告集)

スポンサーリンク

概要

• 論文の詳細を見る
• 京都大学の論文

著者

• 渡辺 治

  Dept.Math.and Comp.Sci Tokyo Inst.of Tech.

• Watanabe Osamu

  Dept. Computer Science Tokyo Institute Of Technology

• Watanabe Osamu

  Dept. Of Math. And Comp. Sci. Tokyo Inst. Of Technology

• Yamamoto Masaki

  School of Informatics, Kyoto University

• Yamamoto Masaki

  School Of Informatics Kyoto University

• 山本 真基

  School of Informatics, Kyoto University

関連論文

• Pseudo Expectation : A Tool for Analyzing Local Search Algorithms
• Provably Fast Training Algorithms for Support Vector Machines
• DS-1-7 On Coppersmith's Technique and its Limit
• On Polynomial Time Many-One Completeness of One-Way Functions : Preliminary Report
• Spectral Analysis of Random Sparse Matrices
• The Relation between Time and Accepting Probability on Probabilistic Simple Decision Trees : Extended abstract(Mathematical Theories on Computing Schemes and Their Applications)
• A planted solution model for the MAX-2SAT problem (情報物理学の数学的構造--RIMS研究集会報告集)
• DS-1-6 A Message Passing Algorithm for MAX2SAT
• An O(n^)-Space and Polynomial-Time Algorithm for Directed Planar Reachability

スポンサーリンク