Polynomial Space and Transitive Closure
From MaRDI portal
Publication:3856099
DOI10.1137/0208035zbMath0422.68014OpenAlexW2069222055MaRDI QIDQ3856099
Publication date: 1979
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0208035
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
On characterizations of the class PSPACE/poly, Bounded query machines: on NP and PSPACE, On some natural complete operators, A note on complete sets and transitive closure