Unifications, deunifications, and their complexity

DOI10.1007/BF01933209zbMath0746.68020OpenAlexW1999492116MaRDI QIDQ1173920

Heikki Mannila, Esko Ukkonen

Publication date: 25 June 1992

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01933209

zbMATH Keywords

unificationtime complexityDatalogdeunification

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic programming (68N17)

Cites Work

• Unnamed Item
• A class of algorithms which require nonlinear time to maintain disjoint sets
• A linear-time algorithm for a special case of disjoint set union
• Making data structures persistent
• Linear unification
• Worst-case Analysis of Set Union Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• New Classes for Parallel Complexity: A Study of Unification and Other Complete Problems for P
• Amortized Analysis of Algorithms for Set Union with Backtracking

This page was built for publication: Unifications, deunifications, and their complexity