Unverified50% confidenceFactExact time
Meir and Moser systematically introduced the class of square packing problems in 1968.
1
Sources
50%
Confidence
Long-term
Relevance
10/7/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedIn 1969, Minsky and Papert proved that a single-layer perceptron cannot solve the XOR problem.55% similarUnverifiedMarčenko and Pastur established the asymptotic theory for the eigenvalue distribution of sample covariance matrices in 1967, while random matrix theory was originally developed by Eugene Wigner in the 1950s.54% similarUnverified结构化编程定理由计算机科学家Böhm和Jacopini在1966年证明，即顺序、分支和循环三种基本控制流结构可以表达任意复杂的逻辑54% similarVerifiedShor's algorithm was proposed by Peter Shor in 1994 and can solve the integer factorization problem in O((log N)³) polynomial time complexity using the quantum Fourier transform.53% similarUnverifiedHoare logic was proposed by computer scientist Tony Hoare in 1969, providing mathematical deductive proof of program correctness through precondition–program statement–postcondition triples.53% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/984794API
curl https://kongchang.com/api/v1/knowledge/claims/984794MCP
get_claim(id=984794)