• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Synthetic Research on the Theory of Algorithms

Research Project

Project/Area Number 06302013
Research Category

Grant-in-Aid for Scientific Research (A)

Allocation TypeSingle-year Grants
Section総合
Research Field General mathematics (including Probability theory/Statistical mathematics)
Research InstitutionTokyo Institute of Technology

Principal Investigator

KOBAYASHI Kojiro  Tokyo Institute of Technology Graduate School of Information Science and Technology Prof., 大学院・情報理工学研究科, 教授 (00016148)

Co-Investigator(Kenkyū-buntansha) MIYANO Satoru  University of Tokyo Human Genome Center Prof., 医科学研究所, 教授 (50128104)
KANO Mikio  Ibakaki University Faculty of Engineering Prof., 工学部, 教授 (20099823)
ENOMOTO Hikoe  Keio University Department of Science and Engineering Prof., 理工学部, 教授 (00011669)
IGARASHI Shigeru  University of Tsukuba Institute of Information Sciences Prof., 電子情報工学系, 教授 (80027367)
ARIKAWA Setsuo  Kyushu University Graduate School of Information Science and Electrical Engineer, 大学院・システム情報科学研究科, 教授 (40037221)
笠井 琢美  電気通信大学, 電気通信学部, 教授 (70027382)
小野 寛晰  北陸先端科学技術大学院大学, 情報科学研究科, 教授 (90055319)
佐藤 雅彦  京都大学, 工学部, 教授 (20027387)
伊藤 達郎  大阪教育大学, 教育学部, 教授 (90015909)
Project Period (FY) 1994 – 1996
Project Status Completed (Fiscal Year 1996)
Budget Amount *help
¥7,800,000 (Direct Cost: ¥7,800,000)
Fiscal Year 1996: ¥2,600,000 (Direct Cost: ¥2,600,000)
Fiscal Year 1995: ¥2,500,000 (Direct Cost: ¥2,500,000)
Fiscal Year 1994: ¥2,700,000 (Direct Cost: ¥2,700,000)
KeywordsIdentification of Differential Equations / Knowledge Propositional Logic / Algebraic Semantics / Relational Algebra / Verification of Programs / Temporal Logic / Structure of Proteins / Music Information Processing / 高階単一化 / セルオートマトン / 文字列パターン / 様相論理 / 時間の論理 / システム同定 / 英文翻訳 / プログラム理論 / 計算モデル / 計算量理論 / グラフの構造
Research Abstract

1. Theory of Algorithms : A framework for developing a theory of numerical computation based on the theory of algorithms was proposed. A method to identify a differential equation from observed numerical data of behavior of a physical system obeying the equation was shown. This method corrects the weakness of the usual one concerning the increase of sizes of intervals resulting from division. 2. Logic and Algorithms : A normal form theorem for the knowledge propositional logic was obtained. Some results that show the usefulness and the limitation of algebraic semantics for nonclassical propositional logic were obtained. The relational calculus and the relational algebra have been sncessfully applied to formulate and analyze several basic notions in computer science such as nondeterministic processes, knowledge base systems, graph rewriting systems, and so on. 3. Programming Languages and Models of Computation : Several formal systmes for analyzing the behavior of parallel programs have been proposed. In one of them, the envelope theory, we can analyze the behavior of parallel programs more naturally than in the usual temporal logic. 4. Algorithms and their Complexity : A new tree structure for representing systax of sentences has been proposed and an English to Japanese translation system based on this tree structure was developed. One method for visualizing music expression in an object oriented environment has been proposed. A hypergraph representation of structures of proteins that captures their tertiary structures in loose way has been proposed. Using this representaion, conformation rules can be formulated as graph rewriting rules, and a PAC learning algorithm has been discovered for a class of conformations. It has been shown that the class of edge-magic graphs cannot be characterized with inhibiting subgraphs.

Report

(4 results)
  • 1996 Annual Research Report   Final Research Report Summary
  • 1995 Annual Research Report
  • 1994 Annual Research Report
  • Research Products

    (146 results)

All Other

All Publications (146 results)

  • [Publications] H.Hirowatari: "Incoporating explanation-based generalization with analogical reasoning" Bull.Inform.Cybernetics. 26. 13-33 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] Y.Mukouchi: "Towards a mathematical theory of machine discovery from facts" Theoretical Computer Science. 137. 53-84 (1995)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] S.Igarashi: "Formal analysis for continuous systems controlled by programs" Asian Computing Science Conference '96,Lecture Notes in Computer Science. 1179. 347-348 (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] R.Hiraga: "Visualized music expression in an object oriented environment" Proc.of International Computer Music Conference. 483-486 (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] H.Enomoto: "The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint" Tokyo J.Math.17. 355-357 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] H.Enomoto: "Connected spanning subgraphs of 3-connected planar graphs" J.Graph Theory. (to appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Kobayashi: "Transformations that preserve malignness of universal distributions" Theoretical Computer Science. (to appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] M.Sato: "A purely functional language with encapsulated assignment." Proc.International Symposium TACS'94 Lecture Notes in Computer Science. 789. 179-202 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] M.Sato: "Intuitionistic and classical natural deduction systems with the Catch and Throw rules" Theoretical Computer Science. (to appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] T.Nishino: "A simulation result for simultaneously bounded Aux PDA'S" IEICE Trans.on Information and Systems. E77-D. 597-600 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] R.Beals: "On the complexity of negation-limited Boolean networks" SIAM J.Computing. (to appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] M.Takahashi: "Normal proofs and their grammar" Information & Computation. 125. 144-153 (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] R.K.Meyer: "The finite model property for BCK and BCIW" Studia Logica. 53. 107-118 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] H.Ono: "Decidability and the finite model property of substructural logics" Proc.of Tbilisi Symposium on Language,Logic and Computation. (to appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] S.Sawato: "Exhaustive computation to derive the lower bound for sorting 13 items" IEICE Trans.Inf.& Syst.E77-D. 1027-1031 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] Y.Kawahara: "Period lengths of cellular automata on square lattices with rule 90" J.Mathematical Physics. 36-3. 1435-1435 (1995)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] Y.Kawahara: "Relational graph rewritings" Theoretical Computer Science. 141. 311-328 (1995)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Kobayashi: "The Kolmogorov complexity,universal distribution,and coding theorem with modified length functions" IEEE Transactions on Information Theory. (to appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] T.Uchida: "Polynomial time algorithm solving the refutation tree problem for formal graph systems" Bull.of Informatics and Cybernetics. 26. 55-74 (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] O.Maruyama: "Inferring a tree from walks" Theoretical Computer Science. 161. 289-300 (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] O.Watanabe: "A framework for polynomial time query learnability" Mathematical Systems Theory. 27. 211-229 (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] O.Watanabe: "Randomized approximation of the constraint satisfaction problem" J.Graph Algorithms and Applications. (to appear).

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] S.Arikawa(ed.): "Algorithmic・Learning Theory(LNAI)" Springer Verlag, (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] 小野寛晰: "情報代数" 共立出版, (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] 西野哲朗: "量子コンピュータ入門" 東京電機大学出版局, (1997)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] 米崎直樹: "計算論入門" 日本評論社(to appear),

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] 小野寛晰: "情報科学における論理" 日本評論社, (1994)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] 西野哲朗: "属性文法入門" 共立出版, (1996)

    • Description
      「研究成果報告書概要(和文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] H.Horiwatari: "Incorporating explanation-based generalization with analogical reasoning" Bull.Informatics and Cybernetics. 26. 13-33 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] Y.Mukouchi: "Towards a mathematical theory of machine discovery from facts" Theoretical Computer Science. 137. 53-84 (1995)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] S.Igarashi: "Formal analysis for continuous systems controlled by programs" Asian Computing Science Conference '96, Lecture Notes in Computing Science. 1179. 347-348 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] R.Hiraga: "Visualized music expression in an object oriented environment" Proc.of International Computer Music Conference. 483-486 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] H.Enomoto: "The condition of Beineke and Harary on edge-disjoint paths some of which are openly disjoint" Tokyo J.Math.17. 355-357 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] H.Enomoto: "Connected spanning subgraphs of 3-connected planar graphs" J.Graph Theory. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] R.K.Meyer: "The finite model property for BCK and BCIW" Studia Logica. 53. 107-118 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] H.Ono: "Decidability and the finite model property of substructural logics" Proc.of Tbilisi Symposium on Language, Logic and Computation. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] S.Sawato: "Exhaustive computation to derive the lower bound for sorting 13 items" IEICE Trans. Information and Systems. E77-D. 1027-1031 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] Y.Kawahara: "Period lengths of cellular automata on square lattices with rule 90" J.Mathematical Physics. 36-3. 1435-1435 (1995)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] Y.Kawahara: "Relational graph rewritings" Theoretical Computer Science. 141. 311-328 (1995)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Kobayashi: "The Kolmogorov complexity, universal distribution, and coding theorem with modified length functions" IEEE Transactions on Information Theory. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Kobayashi: "Transformations that preserve malignness of universal distributions" Theoretical Computer Science. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] M.Sato: "A purely functional language with encapsulated assignment" Proc.International Symposium TACS'94, Lecture Notes in Computer Science. 789. 179-202 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] M.Sato: "Intuitionistic and classical natural deduction systems with the Catch and Throw rules" Theoretical Computer Science. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] T.Nishino: "A simulation result for simultaneously bounded AuxPDA's" IEICE Trans.on Information and Systems. E77-D. 597-600 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] R.Beals: "On the complexity of negation-limited Boolean networks" SIAM J.Computing. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] M.Takahashi: "Normal proofs and their grammar" Information and Computation. 125. 144-153 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] T.Uchida: "Polynomial time algorithm solving the refutation tree problem for formal graph systems" Bull.of Informatics and Cybernetics. 26. 55-74 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] O.Maruyama: "Inferring a tree from walks" Theoretical Computing Science. 161. 289-300 (1996)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] O.Watanabe: "A framework for polynomial time query learnabiliy" Mathematical Systems Theory. 27. 211-229 (1994)

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] O.Watanabe: "Randomized approximation of the constraint satisfaction problem" J.Graph Algorithms and Applications. (to appear).

    • Description
      「研究成果報告書概要(欧文)」より
    • Related Report
      1996 Final Research Report Summary
  • [Publications] K.Kiwata: "Introducing types into elementary formal systems" Bull.Informatics and Cybernetics. Vol.28,no.1. 79-89 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] 有川節夫: "機械学習から機械発見へ" 人工知能学会誌. 11巻6号. 35-43 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] S.Igarashi: "Formal analysis for continuous systems controlled by programs" Asian Computing Science Conference '96,Lecture Notes in Computer Science. 1179. 347-348 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] S.Igarashi: "Formal verification and evaluation of execution time in the envelope theory" Asian Computing Science Conference '96,Lecture Notes in Computer Science. 1179. 299-308 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] S.Igarashi: "Visualization of music based on its structure" International Conference on Computer Music and Music Systems. 21-26 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] H.Enomoto: "Graph decompositions without isolated vertices,II" J.Math.Soc.Japan. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] H.Enomoto: "Graph decompositions without isolated vertices,III" J.Graph Theory. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] 大芝猛: "知識論理・様相論理の標準形展開基底による特性化" 数理解析研究所講究録. 950. 189-192 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] H.Ono: "Algebraic semantics for predicate logics and their completeness" Logic at Work:Essays dedicated to the memory of Helena Rosiowa(ed.by Orlowska). (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] H.Ono: "Decidability and the finite model propety of substructural logic" Proc.of Tbilisi Symposium on Language,Logic and Computation,CSLI Lecture Note. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] 黒川浩一: "機械翻訳のための新しい木構造,左右木について" 電子情報通信学会論文誌D-I. J79-D-I,No.6. 311-319 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] H.Y.Lee: "Transition diagrams of finite cellular automata" Bull.Inform.Cybernet.28. 47-69 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] Y.Kawahara: "Period lengths of cellular automata cam-95 with memory" J.of Mathematical Physics. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] K.Kobayashi: "The Kolmogorof complexity,universal distribution,and coding theorem with modified length functions" IEEE Transactions on imformation Theory. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] K.Kobayashi: "Transformations that preserve malignness of universal distributions" Theoretical Computer Science. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] 藤田博征: "「結合子による高階単一化」再考" コンピュータソフトウェア. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] M.Sato: "Intuitionistic and classical natural deduction systems with the catch and throw rules" Theoretical Computer Sciece. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] 山中淳彦: "参照透明な代入をもつ純関数型言語" コンピュータソフトウェア. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] K.Tanaka: "Negation-limited circuit complexity of Symmetric functions" Imformation Processing Letters. 59. 273-279 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] R.Beals: "On the complexity of negation-limited Boolean networks" SIAM J.Computing. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] M.Takahashi: "Normal proofs and their grammar" Information and Computation. 125. 144-153 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] O.Maruyama: "Inferring a tree from walks" Theoretical Computing Science. 161. 289-300 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] O.Maruyama: "Taking a walk on a graph" Mathematica Japonica. 43. 595-606 (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] O.Watanabe: "Randomized approximation of the constraint satisfaction problem" Graph Algorithms and Applications. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] J.Balcazar: "An optimal parallel algorithm for learning DFA" J.of Universal Computer Science. (to appear).

    • Related Report
      1996 Annual Research Report
  • [Publications] 有川節夫: "知識科学の展開" オーム社, (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] S.Arikawa: "Algorithmic Learning Theory,LNAI" Springer-Verlag, (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] 西野哲朗: "属性文法入門" 共立出版, (1996)

    • Related Report
      1996 Annual Research Report
  • [Publications] 有川節夫: "形式言語の理論" 丸善出版(to appear),

    • Related Report
      1996 Annual Research Report
  • [Publications] 米崎直樹: "計算論入門" 日本評論社(to appear),

    • Related Report
      1996 Annual Research Report
  • [Publications] K. Kobayashi: "Transformations that preserve malignness of universal destributions" Lecture Notes in Computer Science. 959. 420-429 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] K. Kobayashi: "The Kolmogorov complexity the universal distribution and the coding theorem with generalized length functions" Res. Rep. on Mathematical and Computing Sciences, Tokyo Institute of Technology. C-115. 1-23 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] H. Enomoto: "Disjoint odd integer subsets having a constant even sum" Discrete Mathematics. 137. 189-193 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] M. Kano: "Edge removing games of star type" Discrete Mathematics. (to appear.

    • Related Report
      1995 Annual Research Report
  • [Publications] Y. Egawa: "Sufficient conditions for a graph to have (g,f)-factois" Discrete Mathematics. (to appear).

    • Related Report
      1995 Annual Research Report
  • [Publications] T. Nishino: "On the negation-limited circuit complexity of cligue functions" IEICE Trans, on Information and Systems. E78-D. 86-89 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] T. Nishino: "On the number of negations needed to compute parity functions" IEICE Transactions on Information and Systems. E78-D. 90-91 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] Y. Kawahara: "Periodic lengths of cellular automata on square lattices with rule 90" J Math. Phys.36-3. 1435-1456 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] O. Maruyama: "Inferring a tree from walks" Theoretical Computer Science. (to appear).

    • Related Report
      1995 Annual Research Report
  • [Publications] O. Maruyama: "Graph inference from a walk for trees of bounded degree 3 is NP-complete" Lecture Notes in Computer Science. 969. 257-266 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] T. Shoudai: "BONSAI Garden: parallel knowledge discovery system for amino acid sequences" Proc. Third International Conference on Intelligent Systems for Molecular Biology. 359-366 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] E. Tateishi: "A greedy strategy for finding motifs from positive and negative examples" RIFIS-TR,Research Institute of Fundamental Information Science, Kyushu University. CS-118. 1-25 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] Y. Mizoguchi: "Rational graph rewritings" Theoretical Computer Science. 141. 311-328 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] Y. Kawahare: "Relational set theory" Lecture Notes in Computer Science. 953. 44-58 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] H. Enomoto: "Graph decompositions without isolated vertices" J Combin. Theory, ser. B. 63. 111-124 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] R. Schuler: "Towards averoge-case complexity analysis of NP optimization problems" Proc. of 10th Annual Conference on Structure in Complexity Theory. 148-159 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] 大矢雅則: "数理情報科学事典" 朝倉書店, 1200 (1995)

    • Related Report
      1995 Annual Research Report
  • [Publications] 西野哲朗: "属性文法入門" 共立出版, 168 (1996)

    • Related Report
      1995 Annual Research Report
  • [Publications] K.Kobayashi: "On coding theorems with modified length functions" Lecture Notes in Computer Science. 792. 255-259 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] S.Arikawa: "Towards a mathematical theory of a machine discovery from facts" Theoretical Computer Science. 137. 53-84 (1995)

    • Related Report
      1994 Annual Research Report
  • [Publications] E.Hirowatari: "Partially isomorphic generalization and analogical reasoning" Lecture Notes in Artificial Intelligence. 784. 234-254 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] Y.Koga: "Explanation-based reuse of Prolog Programs" Lecture Notes in Artificial Intelligence. 872. 149-160 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] K.Tomita: "Analysis of a software/hardware.system.by tense arithmetic" Lecture Notes in Computer Science. 792. 188-205 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] S.Igarashi: "On locomorphism in analytical equivalence theory" Lecture Notes in Computer Science. 792. 173-187 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 五十嵐 滋: "演奏表情の表現と重奏システムへの応用" 第36回プログラミング・シンポジウム講演集. 47-56 (1995)

    • Related Report
      1994 Annual Research Report
  • [Publications] 白銀 哲也: "時間の論理の束モデルの拡張" 応用数学合同研究集会報告集. 6-1-6-3 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 塩 雅之: "時間の論理の束モデルの2次元解釈" 応用数学合同研究集会報告集. 5-1-5-6 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 畑中 秀行: "時間の論理の語モデルにおける同値性判定手続きの実現" 応用数学合同研究集会報告集. 4-1-4-2 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 清野 桂子: "音楽の演奏表情の図形的表現についての考察" 応用数学合同研究集会報告集. 7-1-7-4 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] S.Hohart: "Irredvcible T-modules of endpoint 1 for bilinear forms qraphs of diameter 3" 数理解析研究所講究録(“Algebraic Combinatorics"). (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] H.Enomoto: "The condition of Beineke and Harary on edge-disjcint paths some of which are openly disjoint" Tokyo J.Math.17. 355-357 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] H.Enomoto: "Graph decompositions without isolated vertices" J.Combinatorial Theory(Ser.B). 63. 111-124 (1995)

    • Related Report
      1994 Annual Research Report
  • [Publications] 大芝 猛: "自動証明における自然な証明生成への一つの近接" 情報処理学会論文誌. 35. 222-231 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] R.K.Meyer: "The finite model Property for BCK and BCIW" Studia Logica. 53. 107-118 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] R.Hori: "Extending intuitionistic linear logic with knotted Structural rules" Notre Dome Journal of Formal Logic. 35. 219-242 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Aoto: "Non-uniqueness of normal Proofs for minimal formulas in implication -conjunction fragment of BCK" Bulletin of the Section of Logic. 23. 104-112 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] S.Iwata: "The Othello game on an nxn board is PSPACE-complete" Theoretical Computer Science. 123. 329-340 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] S.Sawato: "Exhaustive computation to derive the lower bound for sorting 13 items" IEICE Trans.Inf.& Syst.E77-D. 1027-1031 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] Y.Egawa: "Sufficient conditions for a graph to have (q,f)-factors" Discrete Matheomatics,. (印刷中).

    • Related Report
      1994 Annual Research Report
  • [Publications] M.Kano: "Edge-removing games of star type" Discrete Mathematics,. (印刷中).

    • Related Report
      1994 Annual Research Report
  • [Publications] A.Kelmans: "Star partitions of graphs" Journal of Graph Theory,. (印刷中).

    • Related Report
      1994 Annual Research Report
  • [Publications] Y.Kawahara: "Relational Structures and Their partial morphisms in the view of single pushout rewriting" Lectvre Notes in Computer Science. 776. 218-233 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] M.Sato: "A Purely functional language with encapsulated assignment" Lectvre Notes in Computer Science. 789. 179-202 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] M.Sato: "Conservativeness of Λ over λσ-calculus" Lecture Notes in Computer Science. 792. 73-94 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 山中 淳彦: "Assignment.を持つ純関数型言語Λの実現について" Workshop on Functional Programming JSSST′95報告集“関数プログラミングII". 201-216 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 亀山 幸義: "自己反映的証明体系RPTの理論と実現" コンピュータソフトウェア. (掲載予定).

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Nishino: "The Emptiness Problem for Iexical-functional grammars is undecidable" IEICE Trans on Information & Systems. E77-D. 597-600 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Nishino: "A Simulation result for simultaneously bounded Aux PDAs" IEICE Trans on Information & Systems. E77-D. 720-722 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Nishino: "On the negation-limited circuit complexity of clique functions" IEICE Trans on Information & Systems. E78-D. 86-89 (1995)

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Nishino: "On the number of negations needed to compute parity functions" IEICE Trans on Information & Systems. E78-D. 90-91 (1995)

    • Related Report
      1994 Annual Research Report
  • [Publications] K.Tanaka: "On the complexity of negation-limited Boolean networks" Proc.of 26th ACM Symposium on Theory of Computing. 38-47 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Mihara: "Quantum computation and NP-complete Problems" Lecture Notes in Computer Science. 834. 387-395 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Mihara: "On a method of solving SAT efficiently using the quantum Turing machine" Proc.of the Workshop on Physics and Computation. 177-185 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] S.Shimozono: "Complexity of alphabet indexing" IEICE Trans on Information & Systems. E78-D. 13-19 (1995)

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Uchida: "Polynomial time algorithms for solving the refutation tree problem for formal graph systems" Bulletin of Informatics and Cybermetics. 26. 55-74 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] P.Orponen: "Instance complexity" Journal of ACM. 41. 96-121 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] O.Watanabe: "A framework for polynomial time query learnability" Mathematical Systems Theory. 27. 211-229 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] O.Watanabe: "Structural analysis of polynomial time query learnability" Mathematical Systems Theory. 27. 231-256 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] J.Balcazar: "The query complexity of learning DFA" New Generation Computing. 12. 337-358 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] T.Thierauf: "On closure properties of Gapp" Computational Complexity. 4. 242-261 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] J.Balcazar: "An optimal parallel algorithm for learning DFA" Proc.7th ACM Conference on Computational Learning Theory. 208-217 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] O.Watanabe: "Test instance generation for promised NP search problems" Proc.9th structure in Complexity Theory Conference. 205-216 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] R.Book: "On random.hard sets for NP" Lecture Notes in Computer Science. 834. 47-55 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] R.Rao: "Upward separation for Fewp and related classes" Inform.Process.Lett.52. 175-180 (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 小野 寛晰: "情報代数" 共立出版, (1994)

    • Related Report
      1994 Annual Research Report
  • [Publications] 小野 寛晰: "情報科学における論理" 日本評論社, (1994)

    • Related Report
      1994 Annual Research Report

URL: 

Published: 1994-04-01   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi