Unverified50% confidenceFactExact time
The paper proves the speedup mainly for three classes of instances: formulas with many biased variables, semi-random 2-CNF formulas, and Max-Cut on regular expander graphs and stochastic block model graphs.
1
Sources
50%
Confidence
Long-term
Relevance
10/30/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe paper applies the algorithm to the Max-Cut problem on graphs generated by regular expander graphs and stochastic block models, and likewise obtains an exponential speedup.74% similarUnverifiedThe paper proposes a three-stage MoR-Tuning procedure that progressively guides the model to perform reasonable recursive sparsity on multimodal inputs.68% similarUnverifiedExisting systematic generalization research typically relies on three types of simplifications: approximately linear action composition, productivity-based testing, and explicitly represented action goals.64% similarUnverified计算模型分为优化模型、统计模型和仿真模型三大类别64% similarUnverified2021年的Chain-of-Thought Prompting论文证明，通过在提示词中加入推理步骤示例，模型的数学推理准确率可提升数十个百分点63% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1114605API
curl https://kongchang.com/api/v1/knowledge/claims/1114605MCP
get_claim(id=1114605)