Feasibility Analysis of Conditional DAG Tasks is co-NPNP-Hard

Sanjoy Baruah. Feasibility Analysis of Conditional DAG Tasks is co-NPNP-Hard. In Audrey Queudet, Iain Bate, Giuseppe Lipari, editors, RTNS'2021: 29th International Conference on Real-Time Networks and Systems, Nantes, France, April 7-9, 2021. pages 165-172, ACM, 2021. [doi]

@inproceedings{Baruah21-0,
  title = {Feasibility Analysis of Conditional DAG Tasks is co-NPNP-Hard},
  author = {Sanjoy Baruah},
  year = {2021},
  doi = {10.1145/3453417.3453422},
  url = {https://doi.org/10.1145/3453417.3453422},
  researchr = {https://researchr.org/publication/Baruah21-0},
  cites = {0},
  citedby = {0},
  pages = {165-172},
  booktitle = {RTNS'2021: 29th International Conference on Real-Time Networks and Systems, Nantes, France, April 7-9, 2021},
  editor = {Audrey Queudet and Iain Bate and Giuseppe Lipari},
  publisher = {ACM},
  isbn = {978-1-4503-9001-9},
}