Minimum circuit size, graph isomorphism, and related problems (Q3176189)
From MaRDI portal
!
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 6908308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum circuit size, graph isomorphism, and related problems |
scientific article; zbMATH DE number 6908308 |
Statements
Minimum Circuit Size, Graph Isomorphism, and Related Problems (English)
0 references
19 July 2018
0 references
reductions between NP-intermediate problems
0 references
graph isomorphism
0 references
minimum circuit size problem
0 references
time-bounded Kolmogorov complexity
0 references
0 references
0 references
0.9979369044303894
0 references
0.8604956269264221
0 references
0.8537755012512207
0 references
0.8126806616783142
0 references
0.8050535917282104
0 references
