Our website is made possible by displaying online advertisements to our visitors.
Please consider supporting us by disabling your ad blocker.

Responsive image

PSPACE

In der Komplexitätstheorie bezeichnet PSPACE die Klasse der Entscheidungsprobleme, die von deterministischen Turingmaschinen mit polynomiellem Platz entschieden werden können.


Previous Page Next Page






بيسبايس Arabic PSPACE Catalan PSPACE Czech PSPACE English PSPACE Spanish PSPACE French PSPACE HE PSPACE Italian PSPACE Japanese PSPACE Korean

Responsive image

Responsive image