Unverified95% confidenceFactExact time
推箱子（Sokoban）在计算复杂性理论中被证明是PSPACE完全问题
1
Sources
95%
Confidence
Long-term
Relevance
6/23/2025
First Seen
Sources
AI Gaming Showdown: O3 Pro Demonstrates Stunning Planning Capabilities
bilibili认真的笨笨6/23/2025
Related Entities
Related Claims
UnverifiedExactly solving POMDPs is computationally PSPACE-hard.74% similarUnverifiedPOMDP的精确求解是PSPACE-complete问题，计算复杂度随状态空间指数增长72% similarUnverified内点法在理论上具有多项式时间复杂度保证，而单纯形法最坏情况下呈指数级复杂度64% similarUnverifiedPOMDP由Astrom于1965年首次形式化描述，精确求解POMDP在计算上是PSPACE难问题61% similarUnverifiedThe hardware heterogeneity of edge nodes makes uniform inference performance guarantees extremely difficult.61% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1224API
curl https://kongchang.com/api/v1/knowledge/claims/1224MCP
get_claim(id=1224)