Computational Complexity of Verifying the Group No-Show Paradox

Cite

Text

Mohsin et al. "Computational Complexity of Verifying the Group No-Show Paradox." International Joint Conference on Artificial Intelligence, 2024.

Markdown

[Mohsin et al. "Computational Complexity of Verifying the Group No-Show Paradox." International Joint Conference on Artificial Intelligence, 2024.](https://mlanthology.org/ijcai/2024/mohsin2024ijcai-computational/)

BibTeX

@inproceedings{mohsin2024ijcai-computational,
  title     = {{Computational Complexity of Verifying the Group No-Show Paradox}},
  author    = {Mohsin, Farhad and Han, Qishen and Ruan, Sikai and Chen, Pin-Yu and Rossi, Francesca and Xia, Lirong},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2024},
  pages     = {2958-2966},
  url       = {https://mlanthology.org/ijcai/2024/mohsin2024ijcai-computational/}
}