Intersection non-emptiness and hardness within polynomial time (Q1622971): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_23 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2885558565 / rank | |||
Normal rank | |||
Latest revision as of 01:49, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Intersection non-emptiness and hardness within polynomial time |
scientific article |
Statements
Intersection non-emptiness and hardness within polynomial time (English)
0 references
22 November 2018
0 references
intersection non-emptiness
0 references
computational complexity
0 references
unary automata
0 references
