COMPLEXITY THEORY AND BOUNDED ARITHMETIC FOR TRULY FEASIBLE COMPUTATION

スポンサーリンク

概要

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

著者

• 黒田 覚

  群馬県立女子大学文学部

• 黒田 覚

  豊田工業高等専門学校

関連論文

• Lindstrom Quantifier and Bounded Arithmetic for LOGCFL (Formal Systems and Computality Theory)
• 限定算術と計算量理論の最近の話題
• Characterizations and problems on LOGCFL (算術体系の証明論--RIMS共同研究報告集)
• Towards affluent proof theory of LOGCFL and related topics (Proof theoretical study of the structure of logic and computation)
• Logical Characterizations of LOGSPACE (短期共同研究 照明論と計算論)
• Complexity theoretical aspects of applicative theories in connection with boolean circuit computations (Sequent Calculi and Proof Theory)
• RECURSION SCHEMATA FOR SLOW GROWING DEPTH CIRCUIT CLASSES (Towards new interaction between category theory and proof theory)
• MODELS OF BOUNDED ARITHMETIC (Towards new interaction between category theory and proof theory)
• COMPLEXITY THEORY AND BOUNDED ARITHMETIC FOR TRULY FEASIBLE COMPUTATION
• COUNTING SMALL SETS IN WEAK BOUNDED ARITHMETIC
• FORCING ON A NONSTANDARD MODEL OF ARITHMETIC(Mathematical Incompleteness in Arithmetic)
• A propositional proof system based on comparator circuits : 基調講演 (証明論と複雑性)

もっと見る 閉じる

スポンサーリンク