"On the computational complexity of detecting possibilistic locality."

Andrew W. Simmons (2018)

> Home

Details and statistics

DOI: 10.1093/LOGCOM/EXX045

access: open

type: Journal Article

metadata version: 2020-01-31

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/logcom/Simmons18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/logcom/Simmons18
Andrew W. Simmons:
On the computational complexity of detecting possibilistic locality. J. Log. Comput. 28(1): 203-217 (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.