From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)

DOI10.4230/LIPICS.CSL.2013.24zbMath1356.68083OpenAlexW2299982751MaRDI QIDQ2958508

Isabel Oitavem

Publication date: 2 February 2017

Full work available at URL: https://doi.org/10.4230/lipics.csl.2013.24

zbMATH Keywords

computational complexityNPPrecursion schemesPspace

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)