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

Responsive image


PSPACE

PSPACE je v teorii složitosti množina všech rozhodovacích problémů, které lze vyřešit Turingovým strojem používajícím polynomiálně omezené množství paměti.[1][2][3]

  1. Sipser 1997, Section 8.2–8.3 (The Class PSPACE, PSPACE-completeness), pp. 281–294.
  2. Sipser 2006, Chapter 8: Space Complexity.
  3. Papadimitriou 1993, Chapter 19: Polynomial space, pp. 455–490.

Previous Page Next Page






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

Responsive image

Responsive image