Why is parity hard for estimation of distribution algorithms?

David Jonathan Coffin, Robert Elliott Smith. Why is parity hard for estimation of distribution algorithms?. In Hod Lipson, editor, Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007. pages 624, ACM, 2007. [doi]

@inproceedings{CoffinS07:0,
  title = {Why is parity hard for estimation of distribution algorithms?},
  author = {David Jonathan Coffin and Robert Elliott Smith},
  year = {2007},
  doi = {10.1145/1276958.1277084},
  url = {http://doi.acm.org/10.1145/1276958.1277084},
  researchr = {https://researchr.org/publication/CoffinS07%3A0},
  cites = {0},
  citedby = {0},
  pages = {624},
  booktitle = {Genetic and Evolutionary Computation Conference, GECCO 2007, Proceedings, London, England, UK, July 7-11, 2007},
  editor = {Hod Lipson},
  publisher = {ACM},
  isbn = {978-1-59593-697-4},
}