zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
An improved algorithm for finding saddlepoints of two-person zero-sum games. (English) Zbl 0754.90067
Summary: It is well-known that one can sort (order) $n$ real numbers in at most $F\sb 0(n)=nl-2\sp l+1$ steps (comparisons) where $l=\lceil\log\sb 2 n\rceil$. We show how to find the strict saddlepoint or prove its absence in an $m$ and $n$ matrix, $m\le n$, in at most $F\sb 0(m)+F\sb 0(m+1)+n+m-3+(n-m)$ $\lceil\log\sb 2(m+1)\rceil$ steps.
91A052-person games
90-08Computational methods (optimization)
Full Text: DOI
[1] Llewellyn DC, Tovey C, and Trick M (1988) Finding Saddlepoints in Two-person, Zero Sum Games, Amer. Math. Monthly 98: 10, 912-918. · Zbl 0664.90096
[2] Savage JE (1976) The Complexity of Computing, Wiley-Interscience Publ., New York. · Zbl 0391.68025