First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time (Q2892784): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:33, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time |
scientific article |
Statements
First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time (English)
0 references
22 June 2012
0 references
nested pushdown trees
0 references
first-order logic
0 references
\(\mathrm{ATIME}(\exp_2(cn), cn)\) lower bounds
0 references
model checking
0 references
