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

Oitavem, Isabel

Open link

Publication date

January 2013

DOI

10.4230/LIPIcs.CSL.2013.24

Publisher

LIPIcs - Leibniz International Proceedings in Informatics. Computer Science Logic 2013 (CSL 2013)

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

Extracted data

We use cookies to provide a better user experience.

Data Protection

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

Abstract

Extracted data

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

Abstract

Extracted data

Related items

Related items