A note on the parallel complexity of anti-unification (Q688579): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal parallel generation of a computation tree form / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sequential nature of unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Term Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Unification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most specific logic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term matching on parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic parallel memories / rank
 
Normal rank

Latest revision as of 11:37, 22 May 2024

scientific article
Language Label Description Also known as
English
A note on the parallel complexity of anti-unification
scientific article

    Statements

    A note on the parallel complexity of anti-unification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 1993
    0 references
    0 references
    anti-unification
    0 references
    NC
    0 references
    unification
    0 references