Intersection non-emptiness and hardness within polynomial time (Q1622971)
From MaRDI portal
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
