Unverified50% confidenceFactExact time
ARC (Arithmetic Recurrence Complexity) is a complexity measure defined by Kosoy in the 2026a and 2026b papers, which allows a polynomial-time prediction algorithm whose error bound is quasi-linear in the complexity.
1
Sources
50%
Confidence
Long-term
Relevance
10/12/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedKolmogorov complexity refers to the true length of a piece of data being equal to the length of the shortest program that can generate it.67% similarUnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks66% similarUnverified内点法在理论上具有多项式时间复杂度保证，而单纯形法最坏情况下呈指数级复杂度64% similarVerifiedSSMs have a linear time complexity advantage in processing long sequences, whereas the attention computation complexity of standard Transformers is quadratic with respect to sequence length.62% similarUnverifiedIn the paper Stringological sequence prediction III, Kosoy proposed a complexity measure based on hierarchical zipline programs, which is weaker than ARC but corresponds to a more efficient prediction algorithm.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1012041API
curl https://kongchang.com/api/v1/knowledge/claims/1012041MCP
get_claim(id=1012041)