Counting Linear Extensions is #P-Complete. Brightwell, G. & Winkler, P. In ACM Symposium on the Theory of Computing, pages 175–181, New Orleans, LA, 1991.
bibtex   
@inproceedings{brightwell-91,
  author    = {Graham Brightwell and
               Peter Winkler},
  title     = {Counting Linear Extensions is \#{P}-Complete},
  booktitle = {ACM Symposium on the Theory of Computing},
  year      = {1991},
  pages     = {175--181},
  address = {New Orleans, LA},
  keywords = {ranking}
}

Downloads: 0