On the Average Time Complexity of Set Partitioning

Ewald Speckenmeyer, Rainer Kemp. On the Average Time Complexity of Set Partitioning. In Egon Börger, Hans Kleine Büning, Michael M. Richter, editors, CSL 89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings. Volume 440 of Lecture Notes in Computer Science, pages 369-381, Springer, 1989.

@inproceedings{SpeckenmeyerK89,
  title = {On the Average Time Complexity of Set Partitioning},
  author = {Ewald Speckenmeyer and Rainer Kemp},
  year = {1989},
  tags = {partitioning},
  researchr = {https://researchr.org/publication/SpeckenmeyerK89},
  cites = {0},
  citedby = {0},
  pages = {369-381},
  booktitle = {CSL  89, 3rd Workshop on Computer Science Logic, Kaiserslautern, Germany, October 2-6, 1989, Proceedings},
  editor = {Egon Börger and Hans Kleine Büning and Michael M. Richter},
  volume = {440},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-52753-2},
}