| Welcome to the Wikipedia Mathematics Reference Desk Archives |
|---|
| The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
December 9
Is there a thing like a problem being "statistically intractable"? Or are problems just NP-complete, unfeasible, intractable in general, no matter whether for statistical methods or any other approach? --Doroletho (talk) 03:24, 9 December 2018 (UTC)[reply]
- Doroletho (talk ยท contribs), are you asking about average-case complexity? 173.228.123.166 (talk) 05:18, 13 December 2018 (UTC)[reply]