A parallel algorithm for the monadic unification problem
type: Item
instance of: scholarly article
title: A parallel algorithm for the monadic unification problem
zbMATH Open document ID: 0604.68035
DOI: 10.1007/BF01934375
author: Ivan E. Auger
author: Mukkai S. Krishnamoorthy
published in: BIT
publication date: 1985-01-01T00:00:00Z
review text: The monadic unification problem is introduced. An \(O(\log^ 2n)\) parallel algorithm to solve this problem is given and shown to be correct.
Mathematics Subject Classification ID: 68Q65
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03B10
zbMATH DE Number: 3976321
MaRDI profile type: Publication
cites work: An overview of computational complexity
cites work: A Transformation System for Developing Recursive Programs
cites work: On the sequential nature of unification
cites work: Parallelism in random access machines
cites work: Computing connected components on parallel computers
cites work: An Efficient Unification Algorithm
cites work: Linear unification
cites work: A Machine-Oriented Logic Based on the Resolution Principle
cites work: An O(logn) parallel connectivity algorithm
full work available at URL: https://doi.org/10.1007/bf01934375
OpenAlex ID: W1975289275
description: scientific article; zbMATH DE number 3976321