On the complexity of resource-bounded logics (2018)
By: Natasha Alechina, Nils Bulling, Stephane Demri, and Brian Logan
Download Information
Natasha Alechina, Nils Bulling, Stephane Demri, and Brian Logan (2018). "On the complexity of resource-bounded logics." Theoretical Computer Science, 750, 69-100.
Bibtex citation
@article{Alechina//:18a,
author = "Natasha Alechina and Nils Bulling and Stephane Demri and Brian Logan",
title = "On the complexity of resource-bounded logics",
journal = "Theoretical Computer Science",
volume = 750,
pages = "69--100"
year = 2018,
url = "https://doi.org/10.1016/j.tcs.2018.01.019",
} full list
