Unverified50% confidenceFactExact time
For semi-random 2-CNF formulas, the new algorithm remains exact and completes in O*(2^{(1-γ)n}) time with high probability.
1
Sources
50%
Confidence
Long-term
Relevance
10/30/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe paper proves that under the missing completely at random (MCAR) assumption, the algorithm is computationally efficient and achieves provable signal recovery at parametric rates.69% similarUnverifiedDeterministic equivalents are a core tool of random matrix theory: when the dimension p and sample size n grow to infinity proportionally (p/n → γ), random quantities converge in probability to deterministic expressions.67% similarUnverifiedThe algorithm is currently still a theoretical result, and a practical implementation may require further optimization of constant factors and numerical stability.66% similarUnverifiedThe core formula of the SM-2 algorithm is I(1)=1 day, I(2)=6 days, I(n)=I(n-1)×EF, with EF initialized at 2.5 and dynamically adjusted based on the user's self-rating of 0–5.65% similarUnverifiedSLICE (Sequential Likelihood-Free Inference via Conformal E-Values) combines conformal inference with e-values to construct exact and anytime-valid confidence sequences for parameters of models with intractable likelihoods.65% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1114606API
curl https://kongchang.com/api/v1/knowledge/claims/1114606MCP
get_claim(id=1114606)