Intersection non-emptiness and hardness within polynomial time (Q1622971)
From MaRDI portal
!
WARNING
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 6983385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Intersection non-emptiness and hardness within polynomial time |
scientific article; zbMATH DE number 6983385 |
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
0.8298788666725159
0 references
0.7328353524208069
0 references
0.7328064441680908
0 references
0.7080819606781006
0 references
0.6990639567375183
0 references
