"On the complexity of resource-bounded logics."

Natasha Alechina et al. (2018)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2018.01.019

access: open

type: Journal Article

metadata version: 2024-10-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/AlechinaBDL18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/AlechinaBDL18
Natasha Alechina, Nils Bulling, Stéphane Demri, Brian Logan:
On the complexity of resource-bounded logics. Theor. Comput. Sci. 750: 69-100 (2018)

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.