On the complexity of resource-bounded logics (Q5915568)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6983758
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of resource-bounded logics |
scientific article; zbMATH DE number 6983758 |
Statements
On the complexity of resource-bounded logics (English)
0 references
23 November 2018
0 references
resource-bounded logics
0 references
vector addition systems with states
0 references
games
0 references
complexity
0 references
temporal logics
0 references
parameters
0 references
0 references
0.9884332418441772
0 references
0.8455976843833923
0 references
0.8448251485824585
0 references
0.8129094243049622
0 references
