A Logical Account of PSPACE
Abstract
The Soft Type Assignment system has been introduced as a language for Polytime Computations. In this work we extend the language by boolean additives constants obtaining a system named BSTA which we will show to be correct and complete for the complexity class of problem decidable in polynomial space.
Origin : Files produced by the author(s)
Loading...