Parallel Algorithms for Term Matching

From MaRDI portal

Revision as of 14:10, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3796803

Jump to:navigation, search

DOI10.1137/0217046zbMath0651.68110OpenAlexW2042647740MaRDI QIDQ3796803

Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer

Publication date: 1988

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0217046

zbMATH Keywords

randomized parallel algorithm unification logic programming directed acyclic graphs term matching directed graph reachability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (7)

Complexity of matching problems ⋮ On the relationship of congruence closure and unification ⋮ Simultaneous rigid E-unification and other decision problems related to the Herbrand theorem ⋮ Optimal parallel algorithms for forest and term matching ⋮ A note on the parallel complexity of anti-unification ⋮ Efficient parallel term matching and anti-unification ⋮ Tight complexity bounds for term matching problems

This page was built for publication: Parallel Algorithms for Term Matching

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3796803&oldid=17366290"