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

Author Isabel Oitavem



PDF
Thumbnail PDF

File

LIPIcs.CSL.2013.24.pdf
  • Filesize: 263 kB
  • 4 pages

Document Identifiers

Author Details

Isabel Oitavem

Cite AsGet BibTex

Isabel Oitavem. From determinism, non-determinism and alternation to recursion schemes for P, NP and Pspace (Invited Talk). In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 24-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/LIPIcs.CSL.2013.24

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.
Keywords
  • Computational complexity
  • Recursion schemes
  • P
  • NP
  • Pspace

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail