On the complexity of unification sequences
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 122-133
- https://doi.org/10.1007/3-540-16492-8_69
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- The set union problem with backtrackingPublished by Springer Nature ,1986
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Linear unificationJournal of Computer and System Sciences, 1978
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975