Unverified50% confidenceFactExact time
The minimax theorem was first proved by von Neumann in 1928, asserting that in a class of games satisfying convexity and compactness, minimax and maximin are equivalent.
1
Sources
50%
Confidence
Long-term
Relevance
10/16/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedMinimax算法最早可追溯到约翰·冯·诺伊曼1928年发表的博弈论奠基性论文74% similarUnverifiedThe theoretical foundation of the minimax algorithm can be traced back to von Neumann's minimax theorem of 1928.69% similarUnverifiedIn 1930, Schnirelmann proved that any large even number can be written as the sum of a finite number of primes.63% similarUnverifiedIn 1951, von Neumann proved the von Neumann inequality: for any contraction operator T and any polynomial p, ‖p(T)‖ ≤ sup{|p(z)| : |z| ≤ 1}.60% similarUnverifiedThe "parity problem" is a core limitation of sieve methods in analytic number theory, systematically revealed by Selberg in the 1940s.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1046750API
curl https://kongchang.com/api/v1/knowledge/claims/1046750MCP
get_claim(id=1046750)