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

Fingerprint

Parallel algorithms
Computational complexity
Combinatorial circuits
Logic circuits
Polynomials
Networks (circuits)

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

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

ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION. / Yasuura, Hiroto.

Unknown Host Publication Title. Ohmsha Ltd, 1984. p. 235-243.

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

Yasuura, H 1984, ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION. in Unknown Host Publication Title. Ohmsha Ltd, pp. 235-243.
Yasuura H. ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION. In Unknown Host Publication Title. Ohmsha Ltd. 1984. p. 235-243
Yasuura, Hiroto. / ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION. Unknown Host Publication Title. Ohmsha Ltd, 1984. pp. 235-243
@inproceedings{b6da1d7b8fe14b39ae5f5d1ff41daa29,
title = "ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION.",
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.",
author = "Hiroto Yasuura",
year = "1984",
month = "12",
day = "1",
language = "English",
isbn = "4274072215",
publisher = "Ohmsha Ltd",
pages = "235--243",
booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - ON PARALLEL COMPUTATIONAL COMPLEXITY OF UNIFICATION.

AU - Yasuura, Hiroto

PY - 1984/12/1

Y1 - 1984/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0021650707&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0021650707&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0021650707

SN - 4274072215

SP - 235

EP - 243

BT - Unknown Host Publication Title

PB - Ohmsha Ltd

ER -