On the computation of powers sets

DOI10.1515/dma.1994.4.2.119zbMath0925.68333OpenAlexW2170760396MaRDI QIDQ3835728

Vadim V. Kochergin

Publication date: 17 May 1995

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1994.4.2.119

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

On some measures of complexity of finite abelian groups ⋮ On Bellman's and Knuth's problems and their generalizations ⋮ Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems

This page was built for publication: On the computation of powers sets