-
Aviezri Siegmund Fraenkel (Hebrew: אביעזרי פרנקל; born June 7, 1929) is an
Israeli mathematician who has made
contributions to
combinatorial game theory...
- edge-partition problems". SIAM J. Comput. 10 (4): 713–717. doi:10.1137/0210054.
Aviezri Fraenkel and D.
Lichtenstein (1981). "Computing a
perfect strategy for...
-
discoverer of life in the Dead Sea and
pioneer in
biological silicon research Aviezri Fraenkel,
mathematician Asher A. Friesem,
physicist Stephen Gelbart, mathematician...
- ), John
Wiley & Sons,
Proposition 3.30, ISBN 9781118594971. Fraenkel,
Aviezri; Lichtenstein,
David (1981). "Computing a
perfect strategy for n×n chess...
- Oklahoman. 25
November 1983. p. 51.
Retrieved 26
March 2022. Fraenkel,
Aviezri S.; Garey, M. R.; Johnson,
David S.; Yesha,
Yaacov (1978). "The complexity...
- 7118 [cs.GT]. Watkins, Mark. "Losing Chess: 1. e3 wins for White" (PDF).
Aviezri Fraenkel; D.
Lichtenstein (1981), "Computing a
perfect strategy for n×n...
-
University Press. p. 105. ISBN 978-0-521-82332-6. Zbl 1086.11015. Fraenkel,
Aviezri S.; Klein,
Shmuel T. (1996). "Robust
universal complete codes for transmission...
-
Endgame Tablebases "7-piece-endgame-tablebase (chess)".
Stack Exchange.
Aviezri Fraenkel; D.
Lichtenstein (1981), "Computing a
perfect strategy for n×n...
- Zermelo–Fraenkel set
theory Albert Fränkel (1848–1916),
German physician Aviezri Fraenkel (born 1929),
Israeli mathematician Baruch Fränkel-Teomim (1760–1828)...
-
upper bound in the table,
which is
detailed in
Shannon number. Fraenkel,
Aviezri S.; Lichtenstein,
David (1981). "Computing a
perfect strategy for n × n...
