License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2013.24
URN: urn:nbn:de:0030-drops-41865
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4186/
Go to the corresponding LIPIcs Volume Portal

Oitavem, Isabel

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

pdf-format:
6.pdf (0.3 MB)

Abstract

Our goal is to approach the classes of computational complexity P, NP, and Pspace in a recursion-theoretic manner. Here we emphasize the connection between the structure of the recursion schemes and the underlying models of computation.

BibTeX - Entry

@InProceedings{oitavem:LIPIcs:2013:4186,
  author =	{Isabel Oitavem},
  title =	{{From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk)}},
  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 =	{Simona Ronchi Della Rocca},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4186},
  URN =		{urn:nbn:de:0030-drops-41865},
  doi =		{10.4230/LIPIcs.CSL.2013.24},
  annote =	{Keywords: Computational complexity, Recursion schemes, P, NP, Pspace}
}

Keywords: Computational complexity, Recursion schemes, P, NP, Pspace
Collection: Computer Science Logic 2013 (CSL 2013)
Issue Date: 2013
Date of publication: 02.09.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI