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

@InProceedings{oitavem:LIPIcs.CSL.2013.24,
  author =	{Oitavem, Isabel},
  title =	{{From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace}},
  booktitle =	{Computer Science Logic 2013 (CSL 2013)},
  pages =	{24--27},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-60-6},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{23},
  editor =	{Ronchi Della Rocca, Simona},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.24},
  URN =		{urn:nbn:de:0030-drops-41865},
  doi =		{10.4230/LIPIcs.CSL.2013.24},
  annote =	{Keywords: Computational complexity, Recursion schemes, P, NP, Pspace}
}