Unverified50% confidenceFactExact time
The PCP theorem shows that NP = PCP[O(log n), O(1)], that is, the verifier uses O(log n) random bits and reads O(1) proof bits.
1
Sources
50%
Confidence
Long-term
Relevance
11/1/2026
First Seen
Sources
AI Cracks the Unique Games Conjecture: A Turning Point for Theoretical Computer Science
youtubeLex Clips11/1/2026
Related Entities
Related Claims
UnverifiedThe P vs NP problem explores whether all problems whose solutions can be quickly verified can also be quickly solved.56% similarUnverified对于包含N个布尔条件的判定表达式，MC/DC至少需要N+1个测试用例，而完全组合覆盖需要2^N个用例56% similarUnverifiedHNSW算法可用O(log N)的复杂度近似完成精确最近邻所需的O(N)线性扫描55% similarUnverifiedn8n allows customization of the polling check frequency, with the fastest interval being once per minute at no cost.55% similarUnverifiedWhen a Merkle Proof verifies whether a row of data belongs to a certain dataset, the verification cost is O(log n), with no need to download the full dataset.54% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1122417API
curl https://kongchang.com/api/v1/knowledge/claims/1122417MCP
get_claim(id=1122417)