A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
スポンサーリンク
概要
- 論文の詳細を見る
- 2012-06-14
著者
-
Seto Kazuhisa
Graduate School Of Informatics Kyoto University
-
Tamaki Suguru
Graduate School Of Informatics Kyoto University
-
Seto Kazuhisa
Graduate School of Informatics, Kyoto University
関連論文
- New Graph Calculi for Planar Non-3-Colorable Graphs
- The Planar Hajos Calculus for Bounded Degree Graphs
- DS-1-4 Enumerating Non-3-colorable Planar Graphs by the Hajos Calculus
- A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
- A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis