ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION.

Hiroto Yasuura

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

19 被引用数 (Scopus)

抄録

The computational complexity of unification in first-order logic under parallel computation scheme is discussed. A parallel unification algorithm is presented on a combinational logic circuit model and its complexity is analyzed. In order to discuss the lower bound of parallel time complexity of unification, we show that unification is the one of the hardest problems in the class of problems resolved by polynomial size circuits. Namely, it seems to be difficult to design very efficient parallel algorithm for unification.

本文言語英語
ホスト出版物のタイトルUnknown Host Publication Title
出版社Ohmsha Ltd
ページ235-243
ページ数9
ISBN(印刷版)4274072215
出版ステータス出版済み - 12 1 1984
外部発表はい

All Science Journal Classification (ASJC) codes

  • 工学(全般)

フィンガープリント

「ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION.」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル