zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Computers and intractability. A guide to the theory of NP-completeness. (English) Zbl 0411.68039
A Series of Books in the mathematical Sciences. San Francisco: W. H. Freeman and Company. X, 338 p. £11.70 (hardcover); £5.80 (1979).

MSC:
68Q25Analysis of algorithms and problem complexity
68-02Research monographs (computer science)
03D15Complexity of computation
68R10Graph theory in connection with computer science (including graph drawing)
94C15Applications of graph theory to circuits and networks
94C30Applications of design theory to circuits and networks
05A17Partitions of integers (combinatorics)
68P20Information storage and retrieval
68M20Performance evaluation of computer systems; queueing; scheduling
90C99Mathematical programming
90B35Scheduling theory, deterministic
91A99Game theory
68Q45Formal languages and automata
68T99Artificial intelligence
68N99Software