ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherOhmsha Ltd
Pages235-243
Number of pages9
ISBN (Print)4274072215
Publication statusPublished - Dec 1 1984
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION.'. Together they form a unique fingerprint.

  • Cite this

    Yasuura, H. (1984). ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION. In Unknown Host Publication Title (pp. 235-243). Ohmsha Ltd.