On the complexity of resource-bounded logics

Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan. On the complexity of resource-bounded logics. Theoretical Computer Science, 750:69-100, 2018. [doi]

Authors

Natasha Alechina

This author has not been identified. Look up 'Natasha Alechina' in Google

Nils Bulling

This author has not been identified. Look up 'Nils Bulling' in Google

Stéphane Demri

This author has not been identified. Look up 'Stéphane Demri' in Google

Brian Logan

This author has not been identified. Look up 'Brian Logan' in Google