Schaefer's theorem may refer to two unrelated theorems:
*
*
Wikimedia Foundation. 2010.
Schaefer (disambiguation) — Schaefer (along with various similar spellings) is a surname of Germanic origin.Schaefer, Schaffer, or Shafer may also refer to: Places Cities and towns: * Shafer, Minnesota, a city in Chisago County * Shafer Township, Chisago County, Minnesota,… … Wikipedia
Schaefer's dichotomy theorem — In computational complexity theory, a branch of computer science, Schaefer s theorem states necessary and sufficient conditions under which a set O of Boolean operators generate polynomial time or NP complete problems when some of the operators… … Wikipedia
Schauder fixed point theorem — The Schauder fixed point theorem is an extension of the Brouwer fixed point theorem to topological vector spaces such as Banach spaces. It asserts that if K is a compact, convex subset of a topological vector space and T is a continuous mapping… … Wikipedia
Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… … Wikipedia
Distance-hereditary graph — A distance hereditary graph. In graph theoretic mathematics, a distance hereditary graph (also called a completely separable graph)[1] is a graph in which the distances in any connected induced subgraph are the same as they are in the original… … Wikipedia
Møller–Plesset perturbation theory — Electronic structure methods Tight binding Nearly free electron model Hartree–Fock method Modern valence bond Generalized valence bond Møller–Plesset perturbation th … Wikipedia
One-in-three 3SAT — In computational complexity theory, one in three 3SAT (also known variously as 1 in 3 SAT and exactly 1 3SAT) is an NP complete problem. The problem is a variant of the 3 satisfiability problem (3SAT). Like 3SAT, the input instance is a… … Wikipedia
Nuclear space — In mathematics, a nuclear space is a topological vector space with many of the good properties of finite dimensional vector spaces. The topology on them can be defined by a family of seminorms whose unit balls decrease rapidly in size. Vector… … Wikipedia
