P

PSPACE-complet

Classe de complexité

In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length (polynomial space) and if every other problem that can be solved in polynomial space can be transformed to it in polynomial time. The problems that are PSPACE-complete can be thought of as the hardest problems in PSPACE, the class of decision problems solvable in polynomial space, because a solution to any one such problem could easily be used to solve any other problem in PSPACE.

Nº Q905967 ★

Commune · Savoirs

PSPACE-complet

Classe de complexité

Texte en anglais

In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length (polynomial space) and if every other problem that can be solved in polynomial space can be transformed to it in polynomial time. The problems that are PSPACE-complete can be thought of as the hardest problems in PSPACE, the class of decision problems solvable in polynomial space, because a solution to any one such problem could easily be used to solve any other problem in PSPACE.

Dernier prix

—

Prix plancher

—

Médiane 7 j

—

Ventes 30 j

0

Fourchette 30 j

—

En circulation

0

Cours

Voir le tableau
Datemédiane MinMaxventes

Historique des ventes

Dernière vente
—
Moyenne 30 j
—
Plus bas 30 j
—
Plus haut 30 j
—
Ventes 7 j
0
Ventes 30 j
0

Aucune vente pour l'instant.

Ventes anonymes : ni acheteur ni vendeur. Les chiffres ne comptent que les ventes entre joueurs.

Sur Wikipédia

Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.

In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input length (polynomial space) and if every other problem that can be solved in polynomial space can be transformed to it in polynomial time. The problems that are PSPACE-complete can be thought of as the hardest problems in PSPACE, the class of decision problems solvable in polynomial space, because a solution to any one such problem could easily be used to solve any other problem in PSPACE. Problems known to be PSPACE-complete include determining properties of regular expressions and context-sensitive grammars, determining the truth of quantified Boolean formulas, step-by-step changes between solutions of combinatorial optimization problems, and many puzzles and games.

Texte : Wikipédia en anglais, CC BY-SA 4.0. ·

Cartes voisines

Voir la fiche

Confirmation