Solvable
912-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …
92List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …
93John G. Thompson — Infobox academic name = Professor John Thompson image size = 250px birth date = birth date and age|1932|10|13 birth place = Ottawa, Kansas nationality = field = Group theory work institutions = Harvard University (1961 62) University of Chicago… …
94SL (complexity) — In computational complexity theory, SL (Symmetric Logspace or Sym L) is the complexity class of problems log space reducible to USTCON ( undirected s t connectivity ), which is the problem of determining whether there exists a path between two… …
95Semisimple Lie algebra — In mathematics, a Lie algebra is semisimple if it is a direct sum of simple Lie algebras, i.e., non abelian Lie algebras mathfrak g whose only ideals are {0} and mathfrak g itself. It is called reductive if it is the sum of a semisimple and an… …
96Simple Simon (solitaire) — Simple Simon is a Solitaire card game played with a regular 52 cards deck (4suits of 13 cards each without Jokers). It became somewhat popular being featured in some computerized collections of Solitaire card games, but itsorigins possibly… …
97Frobenius group — In mathematics, a Frobenius group is a transitive permutation group on a finite set, such that no non trivial elementfixes more than one point and some non trivial element fixes a point. They are named after F. G. Frobenius. Structure The… …
98List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …
99Differential algebraic equation — In mathematics, differential algebraic equations (DAEs) are a general form of (systems of) differential equations for vector–valued functions x in one independent variable t, where is a vector of dependent variables and the system has as many… …
100IP (complexity) — In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. The concept of an interactive proof system was first introduced by Goldwasser, et al. in 1985. An interactive proof system consists …
