Old Web
English
Sign In
Acemap
>
Paper
>
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete.
Timeline-Based Planning over Dense Temporal Domains with Trigger-less Rules is NP-Complete.
2018
Laura Bozzelli
Alberto Molinari
Angelo Montanari
Adriano Peron
Gerhard J. Woeginger
Keywords:
Discrete mathematics
Computer science
Theoretical computer science
NP-complete
Timeline
Computer network
Correction
Source
Cite
Save
Machine Reading By IdeaReader
7
References
3
Citations
NaN
KQI
[]