In computational complexity theory, a
Wikimedia Foundation. 2010.
PSPACE — Unsolved problems in computer science Is P = PSPACE ? PSPACE … Wikipedia
PSPACE-complete — Mathematicians and computer scientists try to carefully define different types of complexity, and PSPACE complete is one of these types.Roughly, PSPACE is all the problems which can be solved by programs which only need a polynomial (in the… … Wikipedia
NP-hard — For a gentler introduction, see P versus NP problem. Euler diagram for P, NP, NP complete, and NP hard set of problems NP hard (non deterministic polynomial time hard), in computational complexity theory, is a class of problems that are,… … Wikipedia
List of PSPACE-complete problems — Here are some of the more commonly known problems that are PSPACE complete when expressed as decision problems. This list is in no way comprehensive. Games and puzzles Generalized versions of: Amazons· Atomix· Geography· Gomoku· Hex· Reversi·… … Wikipedia
Circuits over sets of natural numbers — Circuits over natural numbers is a mathematical model used in studying computational complexity theory. It is a special case of circuit, the object is a labeled directed acyclic graph the nodes of which evaluate to sets of natural numbers, the… … Wikipedia
True quantified Boolean formula — The language TQBF is a formal language in computer science that contains True Quantified Boolean Formulas. A fully quantified boolean formula is a formula in first order logic where every variable is quantified (or bound), using either… … Wikipedia
Generalized geography — In computational complexity theory, generalized geography is a problem that can be proven to be PSPACE Complete.IntroductionGeography is a childs game, which is good for a long car trip, where players take turns naming cities from anywhere in the … Wikipedia
Hex (board game) — Infobox Game subject name=The Game of Hex image link= image caption=A rendering of a Hex game on a 19x19 board players=2 ages=4+ setup time=1 minute playing time=15 minutes (11x11 board) complexity=Low strategy=High random chance=None… … Wikipedia
Lógica de descripción — Las lógicas de descripción, también llamadas lógicas descriptivas (DL por description logics) son una familia de lenguajes de representación del conocimiento que pueden ser usados para representar conocimiento terminológico de un dominio de… … Wikipedia Español
List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… … Wikipedia
