A complement to Tarjan's result about the lower bound on the complexity of the set union problem期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

A complement to Tarjan's result about the lower bound on the complexity of the set union problem

Authors:	Lech Banachowski

Affiliation:	Institute of Informatics, Warsaw University, Warsaw, Poland

Abstract:

Keywords:	Lower bound complexity set union problem
本文献已被 ScienceDirect 等数据库收录！