"Feasibility analysis of recurrent DAG tasks is PSPACE-hard."

Vincenzo Bonifaci, Alberto Marchetti-Spaccamela (2025)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2024.115062

access: closed

type: Journal Article

metadata version: 2025-01-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/BonifaciM25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BonifaciM25
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela:
Feasibility analysis of recurrent DAG tasks is PSPACE-hard. Theor. Comput. Sci. 1030: 115062 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.