2026-08-17T21:10:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4186 2024-03-06T10:34:51Z ddc:004 open_access

From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk) Oitavem, Isabel Computational complexity Recursion schemes P NP Pspace 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Isabel Oitavem 2013 Is Part Of LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2013.24 urn:nbn:de:0030-drops-41865 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.24 eng https://creativecommons.org/licenses/by/3.0/legalcode