The Relation between Time and Accepting Probability on Probabilistic Simple Decision Trees : Extended abstract(Mathematical Theories on Computing Schemes and Their Applications)
スポンサーリンク
概要
著者
-
Watanabe Osamu
Dept. Of Information Sciences Tokyo Inst. Of Technology
-
Watanabe Osamu
Dept. Computer Science Tokyo Institute Of Technology
関連論文
- Pseudo Expectation : A Tool for Analyzing Local Search Algorithms
- 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