Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy (Q1647695): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Klaus-Joern Lange / rank | |||
| Property / author | |||
| Property / author: Klaus-Joern Lange / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-77313-1_12 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2793155354 / rank | |||
Normal rank | |||
Latest revision as of 23:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy |
scientific article |
Statements
Deciding regular intersection emptiness of complete problems for PSPACE and the polynomial hierarchy (English)
0 references
26 June 2018
0 references
automata and logic
0 references
emptiness of regular intersection
0 references
quantified Boolean formula
0 references
PSPACE
0 references
polynomial hierarchy
0 references
