A parallel algorithm for the monadic unification problem (Q1083189)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3976321
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parallel algorithm for the monadic unification problem |
scientific article; zbMATH DE number 3976321 |
Statements
A parallel algorithm for the monadic unification problem (English)
0 references
1985
0 references
The monadic unification problem is introduced. An \(O(\log^ 2n)\) parallel algorithm to solve this problem is given and shown to be correct.
0 references
