On the average time complexity of set partitioning

DOI10.1007/3-540-52753-2_51MaRDI QIDQ4268473zbMATH OpenFDO

Authors Ewald Speckenmeyer, Rainer Kemp

Publication date 28 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-52753-2_51

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• Exact satisfiability, a natural extension of set partition, and its average case behavior
• The scientific works of Rainer Kemp (1949--2004)

This page was built for publication: On the average time complexity of set partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268473)