It's the size of the term. See this paper which proves the result for details: h... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

kachnuv_ocasek on May 11, 2023 | parent | context | favorite | on: Problems harder than NP-Complete

It's the size of the term. See this paper which proves the result for details: https://link.springer.com/chapter/10.1007/3-540-52590-4_50

mmoskal on May 12, 2023 [–]

More specifically, time is almost linear with the size of the type, which can be doubly exponential compared to the program but people don't write such programs.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact