On the complexity of restarting (Q2330563)
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 7121072
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of restarting |
scientific article; zbMATH DE number 7121072 |
Statements
On the complexity of restarting (English)
0 references
22 October 2019
0 references
restarts
0 references
fixed-cutoff strategy
0 references
probability distribution
0 references
computational complexity
0 references
NP
0 references
\(\#\)P
0 references
inapproximability
0 references
0.8365614414215088
0 references
0.818138599395752
0 references
0.7905434370040894
0 references
0.7862452864646912
0 references
0.7659415006637573
0 references
