Wyświetlanie pozycji 1-1 z 1

    • Proof Compression and NP Versus PSPACE II 

      Gordeev, Lew; Haeusler, Edward Hermann (Wydawnictwo Uniwersytetu Łódzkiego, 2020-11-04)
      We upgrade [3] to a complete proof of the conjecture NP = PSPACE that is known as one of the fundamental open problems in the mathematical theory of computational complexity; this proof is based on [2]. Since minimal ...