Unverified50% confidenceFactExact time
飞机登机问题在运筹学和计算机科学中被归类为NP-hard问题的变体
1
Sources
50%
Confidence
Long-term
Relevance
8/20/2026
First Seen
Sources
遗传算法+神经网络：登机效率超越Steffen法9.6%
Related Claims
UnverifiedNP-hard problems are at least as hard as the hardest problems in NP.62% similarVerifiedResearch by NASA and the FAA found that pilots who over-rely on autopilot systems experience a 'skill degradation trap'—their manual flying abilities deteriorate and their emergency responses slow when systems fail.61% similarUnverifiedComplex questions involving system architecture trade-offs, hands-on performance tuning experience, and technology selection for specific business scenarios remain areas where current AI cannot reliably provide answers.61% similarUnverified数独求解是NP完全问题，极难数独可能需要深层次的假设-回溯搜索60% similarUnverifiedIn scenarios involving state management, concurrency logic, or cross-service dependencies, AI conflict resolution may introduce subtle semantic errors that are difficult to catch through conventional testing.57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/778701API
curl https://kongchang.com/api/v1/knowledge/claims/778701MCP
get_claim(id=778701)