Theses and Dissertations
Now showing items 1-1 of 1
Representation techniques for relational languages and the worst case asymptotical time complexity behaviour of the related algorithms.
(Monterey, California. Naval Postgraduate School, 1982-06)
This thesis is aimed at determining the worst case asymptotical time complexity behavior of algorithms for relational operations that work on extensionally or intensionally represented binary relations. Those relational ...