The set union problem with backtracking
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 236-243
- https://doi.org/10.1007/3-540-16761-7_73
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On the complexity of unification sequencesPublished by Springer Nature ,1986
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- A linear-time algorithm for a special case of disjoint set unionPublished by Association for Computing Machinery (ACM) ,1983
- A class of algorithms which require nonlinear time to maintain disjoint setsJournal of Computer and System Sciences, 1979
- Prolog - the language and its implementation compared with LispACM SIGPLAN Notices, 1977
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975